Computation of constrained channel capacity by network's method

Kiyotaka Yamamura, Shinichi 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
Externally publishedYes

Fingerprint

Channel Capacity
Channel capacity
Local Quadratic Convergence
Computing
Linear Constraints
Global Convergence
Newton Methods
Newton-Raphson method
High Accuracy
Efficient Algorithms
Numerical Solution
Numerical Examples

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Computation of constrained channel capacity by network's method. / Yamamura, Kiyotaka; Oishi, Shinichi; Horiuchi, Kazuo.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E76-A, No. 6, 06.1993, p. 1043-1048.

Research output: Contribution to journalArticle

@article{6b44c4d3983f418da8a60cea22a3ee14,
title = "Computation of constrained channel capacity by network's method",
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.",
author = "Kiyotaka Yamamura and Shinichi Oishi and Kazuo Horiuchi",
year = "1993",
month = "6",
language = "English",
volume = "E76-A",
pages = "1043--1048",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "6",

}

TY - JOUR

T1 - Computation of constrained channel capacity by network's method

AU - Yamamura, Kiyotaka

AU - Oishi, Shinichi

AU - Horiuchi, Kazuo

PY - 1993/6

Y1 - 1993/6

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

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

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

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

M3 - Article

AN - SCOPUS:0027617572

VL - E76-A

SP - 1043

EP - 1048

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 6

ER -