Finite-blocklength channel coding rate under a long-term power constraint

Author(s)
Yang, Wei; Caire, Giuseppe; Durisi, Giuseppe; Polyanskiy, Yury
Thumbnail
DownloadPolyanskiy_Finite-blocklength.pdf (316.7Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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.
Date issued
2014-06
URI
http://hdl.handle.net/1721.1/101008
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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
ISBN
978-1-4799-5186-4
Collections