Title :
On calculating the capacity of an infinite-input finite (infinite)-output channel
Author :
Chang, Chein-I ; Davisson, Lee D.
Author_Institution :
Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA
fDate :
9/1/1988 12:00:00 AM
Abstract :
A version of the Arimoto-Blahut algorithm for continuous channels involves evaluating integrals over an entire input space and thus is not tractable. Two generalized discrete versions of the Arimoto-Blahut algorithm are presented for this purpose. Instead of calculating integrals, both algorithms require only the computation of a sequence of finite sums. This significantly reduces numerical computational complexity
Keywords :
channel capacity; computational complexity; integral equations; Arimoto-Blahut algorithm; channel capacity; continuous channels; generalized discrete versions; infinite-input finite infinite-output channel; integrals; numerical computational complexity; Approximation algorithms; Channel capacity; Computational complexity; Convergence; Helium; Information theory; Integral equations; Iterative algorithms; Minimax techniques;
Journal_Title :
Information Theory, IEEE Transactions on
