Finding sufficient inputs to calculate communications channel capacity

Finding sufficient inputs to calculate communications channel capacity

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IEE Proceedings - Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A method is suggested for finding only those source inputs that are sufficient for computing the capacity of large communications channels. An efficient algorithm is proposed to implement the method. The suggested approach has application in finding the capacity of large telecommunications channels, such as those with intersymbol interference, which are computationally intensive. A discrete memoryless channel provides an example of the application of the algorithm.


    1. 1)
      • M. Cheng . On the computation of a discrete memoryless channel. Inf. Control , 292 - 298
    2. 2)
      • S. Arimoto . An algorithm for computing the capacity of arbitrary discrete memorylesschannels. IEEE Trans. Inf. Theory , 14 - 20
    3. 3)
      • R. Blahut . Computation of channel capacity and the rate-distortion function. IEEE Trans. Inf. Theory , 460 - 473
    4. 4)
      • S. Takano . On a method of calculating the capacity of a discrete memoryless channel. Inf. Control , 327 - 336
    5. 5)
      • R.G. Gallager . (1968) Information theory and reliable communications.

Related content

This is a required field
Please enter a valid email address