2012/06/23 by Shlomi Vituri, Meir Feder, Vituri, Shlomi +1
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Networks Research #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1206.5401
openalex publication_date 2012/06/23 · arxiv created 2014/04/20 · arxiv updated 2014/04/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this work we extend the setting of communication without power constraint, proposed by Poltyrev, to fast fading channels with channel state information (CSI) at the receiver. The optimal codewords density, or actually the optimal normalized log density (NLD), is considered. Poltyrev's capacity for this channel is the highest achievable NLD, at possibly large block length, that guarantees a vanishing error probability. For a given finite block length n and a fixed error probability, there is a gap between the highest achievable NLD and Poltyrev's capacity. As in other channels, this gap asymptotically vanishes as the square root of the channel dispersion V over n, multiplied by the inverse Q-function of the allowed error probability. This dispersion, derived in the paper, equals the dispersion of the power constrained fast fading channel at the high SNR regime. Connections to the error exponent of the peak power constrained fading channel are also discussed.