Computation of constrained channel capacity by network's method

Kiyotaka Yamamura, Shin'ichi Oishi, Kazuo Horiuchi

Research output: Contribution to journalArticle

Abstract

Algorithms for computing channel capacity have been proposed by many researches. Recently, one of the authors proposed an efficient algorithm using Newton's method. Since this algorithm has local quadratic convergence, it is advantageous when we want to obtain a numerical solution with high accuracy. In this letter, it is shown that this algorithm can be extended to the algorithm for computing the constrained capacity, i.e the capacity of discrete memoryless channels with linear constraints. The global convergence of the extended algorithm is proved, and its effectiveness is verified by numerical examples.

Original languageEnglish
Pages (from-to)1043-1048
Number of pages6
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE76-A
Issue number6
Publication statusPublished - 1993 Jun 1

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Computation of constrained channel capacity by network's method'. Together they form a unique fingerprint.

  • Cite this