Geometric programming dual of channel capacity

Mung Chiang; Stephen Boyd

Geometric programming dual of channel capacity

Mung Chiang, Stephen Boyd

Electrical and Computer Engineering

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

Abstract

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 language	English (US)
Pages (from-to)	291
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
State	Published - 2003
Event	Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: Jun 29 2003 → Jul 4 2003

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Cite this

@article{775029a250d746cfbce4c88f934aaa8b,

title = "Geometric programming dual of channel capacity",

abstract = "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.",

author = "Mung Chiang and Stephen Boyd",

year = "2003",

language = "English (US)",

pages = "291",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8096",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) ; Conference date: 29-06-2003 Through 04-07-2003",

}

TY - JOUR

T1 - Geometric programming dual of channel capacity

AU - Chiang, Mung

AU - Boyd, Stephen

PY - 2003

Y1 - 2003

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

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

UR - https://www.scopus.com/pages/publications/0141904503

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

M3 - Conference article

AN - SCOPUS:0141904503

SN - 2157-8096

SP - 291

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - Proceedings 2003 IEEE International Symposium on Information Theory (ISIT)

Y2 - 29 June 2003 through 4 July 2003

ER -

Geometric programming dual of channel capacity

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this