Computer Science – Information Theory
Scientific paper
2007-04-19
Computer Science
Information Theory
This paper will be presented in IEEE International Symposium on Information Theory (ISIT) 2007 in Nice, France
Scientific paper
10.1109/ISIT.2007.4557204
On a fading channel with no channel state information at the receiver, calculating true log-likelihood ratios (LLR) is complicated. Existing work assume that the power of the additive noise is known and use the expected value of the fading gain in a linear function of the channel output to find approximate LLRs. In this work, we first assume that the power of the additive noise is known and we find the optimum linear approximation of LLRs in the sense of maximum achievable transmission rate on the channel. The maximum achievable rate under this linear LLR calculation is almost equal to the maximum achievable rate under true LLR calculation. We also observe that this method appears to be the optimum in the sense of bit error rate performance too. These results are then extended to the case that the noise power is unknown at the receiver and a performance almost identical to the case that the noise power is perfectly known is obtained.
Ardakani Masoud
Yazdani Raman
No associations
LandOfFree
Optimum Linear LLR Calculation for Iterative Decoding on Fading Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Optimum Linear LLR Calculation for Iterative Decoding on Fading Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimum Linear LLR Calculation for Iterative Decoding on Fading Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-212465