On capacity of a constrained two-dimensional channel in presence of violations

Negar Kiyavash, Richard E. Blahut

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We will illustrate the connection between the Ising problem in statistical mechanics and the problem of computing the constrained capacity of an array of the same dimension. Using this connection, we show that for a given amount of violation, a soft constrained capacity can be computed. The classical Shannon capacity of a constrained channel is merely an end point of the soft capacity curve, where no violations are allowed. Moreover we reduce the problem of computing the constrained capacity to that of computing the eigenvalues of a special matrix. We claim that an analytical solution to calculating the eigenvalues of interest corresponds to solving the special case of the two-dimensional constrained channel with the constraint (1, ∞).

Original languageEnglish (US)
Title of host publicationProceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Pages2423-2427
Number of pages5
DOIs
StatePublished - Dec 1 2006
Event2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States
Duration: Jul 9 2006Jul 14 2006

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Other

Other2006 IEEE International Symposium on Information Theory, ISIT 2006
Country/TerritoryUnited States
CitySeattle, WA
Period7/9/067/14/06

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'On capacity of a constrained two-dimensional channel in presence of violations'. Together they form a unique fingerprint.

Cite this