Computer Science – Information Theory
Scientific paper
2006-04-11
Computer Science
Information Theory
13 pages, version without proofs submitted to ISIT 2006
Scientific paper
Flat-fading channels that are correlated in time are considered under peak and average power constraints. For discrete-time channels, a new upper bound on the capacity per unit time is derived. A low SNR analysis of a full-scattering vector channel is used to derive a complimentary lower bound. Together, these bounds allow us to identify the exact scaling of channel capacity for a fixed peak to average ratio, as the average power converges to zero. The upper bound is also asymptotically tight as the average power converges to zero for a fixed peak power. For a continuous time infinite bandwidth channel, Viterbi identified the capacity for M-FSK modulation. Recently, Zhang and Laneman showed that the capacity can be achieved with non-bursty signaling (QPSK). An additional contribution of this paper is to obtain similar results under peak and average power constraints.
Hajek Bruce
Sethuraman Vignesh
No associations
LandOfFree
Low SNR Capacity of Fading Channels with Peak and Average Power Constraints 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 Low SNR Capacity of Fading Channels with Peak and Average Power Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low SNR Capacity of Fading Channels with Peak and Average Power Constraints will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-225245