Capacity per unit energy of fading channels with a peak constraint

Vignesh Sethuraman, Bruce Hajek

Research output: Contribution to journalConference article

Abstract

We consider a discrete-time flat fading channel with no side information. We bound the capacity of such a channel by finding the capacity per unit energy in the presence of a hard peak constraint.

Original languageEnglish (US)
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
DOIs
StatePublished - 2003
EventProceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan
Duration: Jun 29 2003Jul 4 2003

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Capacity per unit energy of fading channels with a peak constraint'. Together they form a unique fingerprint.

  • Cite this