By Topic

The distribution of the sequential decoding computation time

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)

Previous studies of sequential decoding algorithms have shown that the computation time required per decoded digit is small, on the average, when the source rate is less than a rate R_{co\mp} . In this paper, we consider the probability distribution of the computation time per decoded digit for the Fano algorithm on the binary symmetric channel. We show by underbounding this distribution that it behaves as L^{-\alpha }, \alpha > 0 , in the distribution parameter L , that is, it is of the Pareto type. We deduce from this fact that the probability of overflowing the buffer required to store data during periods of high computation is relatively insensitive to the buffer storage capacity and to the maximum speed of the accompanying logic unit. It is shown that this lack of sensitivity exists because the computation per decoded digit is large during intervals of high channel noise and grows exponentially with the length of such an interval. The overflow probability, however, is a strong function of the source rate and is more than squared by a halving of this rate.

Published in:

IEEE Transactions on Information Theory  (Volume:12 ,  Issue: 2 )