Resolvability and the capacity of AWGN channels are equal

T. S. Han, Sergio Verdu

Research output: Contribution to conferencePaper

3 Scopus citations

Abstract

The validity of the proof of the converse of the previously proposed resolvability formula was seen to be hinged heavily on the assumption that the input alphabet of the channel is finite. This study aims to show that this restriction can be relaxed and the previous resolvability formula continues to hold also for a wide class of channels with continuous input alphabet, including a special case additive white Gaussian noise channels with power constraint P.

Original languageEnglish (US)
StatePublished - Dec 1 1994
EventProceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw
Duration: Jun 27 1994Jul 1 1994

Other

OtherProceedings of the 1994 IEEE International Symposium on Information Theory
CityTrodheim, Norw
Period6/27/947/1/94

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'Resolvability and the capacity of AWGN channels are equal'. Together they form a unique fingerprint.

  • Cite this

    Han, T. S., & Verdu, S. (1994). Resolvability and the capacity of AWGN channels are equal. Paper presented at Proceedings of the 1994 IEEE International Symposium on Information Theory, Trodheim, Norw, .