Finite-blocklength channel coding rate under a long-term power constraint
Name
Polyanskiy_Finite-blocklength.pdf
Size
316.71 KB
Format
Adobe PDF
Checksum (MD5)
75c57ca2ffa2a1f9da579c2192bebf03
Author(s)
Yang, Wei
Caire, Giuseppe
Durisi, Giuseppe
Polyanskiy, Yury
Date Issued
June 2014
Journal
Proceedings of the 2014 IEEE International Symposium on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Yang, Wei, Giuseppe Caire, Giuseppe Durisi, and Yury Polyanskiy. “Finite-Blocklength Channel Coding Rate Under a Long-Term Power Constraint.” 2014 IEEE International Symposium on Information Theory (June 2014).
Version
Author's final manuscript
Abstract
This paper investigates the maximal channel coding rate achievable at a given blocklength n and error probability ε, when the codewords are subject to a long-term (i.e., averaged-over-all-codeword) power constraint. The second-order term in the large-n expansion of the maximal channel coding rate is characterized both for AWGN channels and for quasi-static fading channels with perfect channel state information at the transmitter and the receiver. It is shown that in both cases the second-order term is proportional to √(log n)/n.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2014.6875197
