Paper Info
Title
Low SNR Capacity of Fading Channels with Peak and Average Power Constraints
Abstract
Flat-fading channels that are correlated in time are consid ered 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 avera ge 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 id entified 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 unde r peak and average power constraints.
Year
DOI
Venue
2006
10.1109/ISIT.2006.261620
international symposium on information theory
Keywords
Field
DocType
indexing terms,channel capacity,fading channel,upper bound,lower bound,discrete time
Topology,Discrete mathematics,Upper and lower bounds,Fading,Control theory,Communication channel,Modulation,Bandwidth (signal processing),Channel capacity,Mathematics,Viterbi algorithm,Phase-shift keying
Journal
Volume
Citations 
PageRank 
abs/cs/060
10
0.57
References 
Authors
12
2
Name
Order
Citations
PageRank
Vignesh Sethuraman1303.65
Bruce Hajek215417.84