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

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...

Full description

Bibliographic Details
Main Authors: Yang, Wei, Caire, Giuseppe, Durisi, Giuseppe, Polyanskiy, Yury
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers (IEEE) 2016
Online Access:http://hdl.handle.net/1721.1/101008
https://orcid.org/0000-0002-2109-0979
_version_ 1811073546380640256
author Yang, Wei
Caire, Giuseppe
Durisi, Giuseppe
Polyanskiy, Yury
author2 Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
author_facet Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Yang, Wei
Caire, Giuseppe
Durisi, Giuseppe
Polyanskiy, Yury
author_sort Yang, Wei
collection MIT
description 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.
first_indexed 2024-09-23T09:34:41Z
format Article
id mit-1721.1/101008
institution Massachusetts Institute of Technology
language en_US
last_indexed 2024-09-23T09:34:41Z
publishDate 2016
publisher Institute of Electrical and Electronics Engineers (IEEE)
record_format dspace
spelling mit-1721.1/1010082022-09-26T12:24:47Z Finite-blocklength channel coding rate under a long-term power constraint Yang, Wei Caire, Giuseppe Durisi, Giuseppe Polyanskiy, Yury Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Polyanskiy, Yury 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. National Science Foundation (U.S.) (CAREER Award Grant CCF-12-53205) 2016-01-27T18:08:32Z 2016-01-27T18:08:32Z 2014-06 Article http://purl.org/eprint/type/ConferencePaper 978-1-4799-5186-4 http://hdl.handle.net/1721.1/101008 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). https://orcid.org/0000-0002-2109-0979 en_US http://dx.doi.org/10.1109/ISIT.2014.6875197 Proceedings of the 2014 IEEE International Symposium on Information Theory Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) MIT web domain
spellingShingle Yang, Wei
Caire, Giuseppe
Durisi, Giuseppe
Polyanskiy, Yury
Finite-blocklength channel coding rate under a long-term power constraint
title Finite-blocklength channel coding rate under a long-term power constraint
title_full Finite-blocklength channel coding rate under a long-term power constraint
title_fullStr Finite-blocklength channel coding rate under a long-term power constraint
title_full_unstemmed Finite-blocklength channel coding rate under a long-term power constraint
title_short Finite-blocklength channel coding rate under a long-term power constraint
title_sort finite blocklength channel coding rate under a long term power constraint
url http://hdl.handle.net/1721.1/101008
https://orcid.org/0000-0002-2109-0979
work_keys_str_mv AT yangwei finiteblocklengthchannelcodingrateunderalongtermpowerconstraint
AT cairegiuseppe finiteblocklengthchannelcodingrateunderalongtermpowerconstraint
AT durisigiuseppe finiteblocklengthchannelcodingrateunderalongtermpowerconstraint
AT polyanskiyyury finiteblocklengthchannelcodingrateunderalongtermpowerconstraint