By Topic

On the capacity of a cascade of identical discrete memoryless nonsingular channels (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

A simplified procedure for calculating the channel capacity of a cascade of N identical discrete memoryless nonsingular channels is presented. The result depends only upon the M eigenvalues and M eigenvectors of any one of the subchannel transition matrices. Thus, for small M and large N (the usual case of interest) the result represents a considerable saving in computation relative to the standard technique of finding the overall channel transition matrix. The procedure is illustrated for an N cascade of binary symmetric channels.

Published in:

IEEE Transactions on Information Theory  (Volume:16 ,  Issue: 1 )