IEICE TRANSACTIONS on Fundamentals
Computation of Constrained Channel Capacity by Newton's Method
Summary :
Algorithms for computing channel capacity have been proposed by many researchers. 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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E76-A No.6 pp.1043-1048
- Publication Date
- 1993/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Numerical Analysis and Self-Validation
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kiyotaka YAMAMURA, Shin'ichi OISHI, Kazuo HORIUCHI, "Computation of Constrained Channel Capacity by Newton's Method" in IEICE TRANSACTIONS on Fundamentals,
vol. E76-A, no. 6, pp. 1043-1048, June 1993, doi: .
Abstract: Algorithms for computing channel capacity have been proposed by many researchers. 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e76-a_6_1043/_p
Copy
@ARTICLE{e76-a_6_1043,
author={Kiyotaka YAMAMURA, Shin'ichi OISHI, Kazuo HORIUCHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Computation of Constrained Channel Capacity by Newton's Method},
year={1993},
volume={E76-A},
number={6},
pages={1043-1048},
abstract={Algorithms for computing channel capacity have been proposed by many researchers. 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.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Computation of Constrained Channel Capacity by Newton's Method
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1043
EP - 1048
AU - Kiyotaka YAMAMURA
AU - Shin'ichi OISHI
AU - Kazuo HORIUCHI
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E76-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 1993
AB - Algorithms for computing channel capacity have been proposed by many researchers. 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.
ER -
English
