If ‘r’ is the code rate and ‘d free ’ is the free distance of the
A. <span class="math-tex">\(10{\log _{10}}\left( {\frac{{{d_{free}}.r}}{2}} \right)\left( {dB} \right)\)</span>
B. 10 log<sub>10</sub>(d<sub>free</sub>.r) (dB)
C. <span class="math-tex">\(10\;{\log _{10}}\left( {\frac{{{d_{free}}}}{{2.r}}} \right)\left( {dB} \right)\)</span>
D. <span class="math-tex">\(10\log \left( {\frac{{{d_{free}}}}{r}} \right)\left( {dB} \right)\)</span>
Please scroll down to see the correct answer and solution guide.
Right Answer is: A
SOLUTION
Asymptotic coding gain is a quantity that is used as a figure of merit for a particular code.
It depends on the code rate ‘r’ and the minimum distance and can be defined for both the unquantized channel and the binary quantized channel.
The asymptotic coding gain for a Binary symmetric AWGN channel is given by
\(r = 10{\log _{10}}\left( {\frac{{r \cdot {d_{free}}}}{2}} \right)\)