Capacity of The Discrete-Time Non-Coherent Memoryless Rayleigh Fading Channels at Low SNR

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

26 pages, 5 figues, submitted to IEEE Trans. on Information Theory, Septembre 2007

Scientific paper

The capacity of a discrete-time memoryless channel, in which successive symbols fade independently, and where the channel state information (CSI) is neither available at the transmitter nor at the receiver, is considered at low SNR. We derive a closed form expression of the optimal capacity-achieving input distribution at low signal-to-noise ratio (SNR) and give the exact capacity of a non-coherent channel at low SNR. The derived relations allow to better understanding the capacity of non-coherent channels at low SNR and bring an analytical answer to the peculiar behavior of the optimal input distribution observed in a previous work by Abou Faycal, Trott and Shamai. Then, we compute the non-coherence penalty and give a more precise characterization of the sub-linear term in SNR. Finally, in order to better understand how the optimal input varies with SNR, upper and lower bounds on the capacity-achieving input are given.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Capacity of The Discrete-Time Non-Coherent Memoryless Rayleigh Fading Channels at Low SNR 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 Capacity of The Discrete-Time Non-Coherent Memoryless Rayleigh Fading Channels at Low SNR, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capacity of The Discrete-Time Non-Coherent Memoryless Rayleigh Fading Channels at Low SNR will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-611374

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.