Minimum energy to send K bits with and without feedback

Yury Polyanskiy, H. Vincent Poor, Sergio Verdu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Scopus citations

Abstract

The question of minimum achievable energy per bit over memoryless channels has been previously addressed in the limit of number of information bits going to infinity, in which case it is known that availability of noiseless feedback does not lower the minimum energy per bit. This paper analyzes the behavior of the minimum energy per bit for memoryless Gaussian channels as a function of the number of information bits. It is demonstrated that in this non-asymptotic regime, noiseless feedback leads to significantly better energy efficiency. A feedback coding scheme with zero probability of block error and finite energy per bit is constructed. For both achievability and converse, the feedback coding problem is reduced to a sequential hypothesis testing problem for Brownian motion.

Original languageEnglish (US)
Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages221-225
Number of pages5
DOIs
StatePublished - 2010
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: Jun 13 2010Jun 18 2010

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8103

Other

Other2010 IEEE International Symposium on Information Theory, ISIT 2010
Country/TerritoryUnited States
CityAustin, TX
Period6/13/106/18/10

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Keywords

  • AWGN channel
  • Brownian motion
  • Feedback
  • Minimum energy per bit
  • Non-asymptotic analysis
  • Shannon theory

Fingerprint

Dive into the research topics of 'Minimum energy to send K bits with and without feedback'. Together they form a unique fingerprint.

Cite this