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
StatePublished - Oct 20 2003
EventProceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan
Duration: Jun 29 2003Jul 4 2003

Fingerprint

Unit of energy
Fading Channels
Fading channels
Side Information
Discrete-time
Unit
Energy

ASJC Scopus subject areas

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

Cite this

Capacity per unit energy of fading channels with a peak constraint. / Sethuraman, Vignesh; Hajek, Bruce.

In: IEEE International Symposium on Information Theory - Proceedings, 20.10.2003.

Research output: Contribution to journalConference article

@article{ea7076a3beb04a1bb2abd4316be4f27a,
title = "Capacity per unit energy of fading channels with a peak constraint",
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.",
author = "Vignesh Sethuraman and Bruce Hajek",
year = "2003",
month = "10",
day = "20",
language = "English (US)",
journal = "IEEE International Symposium on Information Theory - Proceedings",
issn = "2157-8095",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Capacity per unit energy of fading channels with a peak constraint

AU - Sethuraman, Vignesh

AU - Hajek, Bruce

PY - 2003/10/20

Y1 - 2003/10/20

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

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

UR - http://www.scopus.com/inward/record.url?scp=0141904650&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0141904650&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0141904650

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8095

ER -