Geometric programming dual of channel capacity

Mung Chiang, Stephen Boyd

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations


We show that the Lagrange dual of the problem of channel capacity with input cost for discrete memoryless channel is a simple and well-structured geometric program. The geometric program dual gives a new class of upper bounds of channel capacity that can be made arbitrarily tight and includes some known bounds as special cases, and a free energy interpretation to channel capacity.

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

All Science Journal Classification (ASJC) codes

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


Dive into the research topics of 'Geometric programming dual of channel capacity'. Together they form a unique fingerprint.

Cite this