2006/04/11 by Vignesh Sethuraman, Sethuraman, Vignesh, Bruce Hajek +1
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Networks Research
paper · pdf · doi:10.48550/arxiv.cs/0604049
openalex publication_date 2006/04/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.