By Topic

Bounds on a probability for the heavy tailed distribution and the probability of deficient decoding in sequential decoding

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)
T. Hashimoto ; Dept. of Electr. Eng., Univ. of Electro-Commun., Tokyo, Japan

Although sequential decoding of convolutional codes gives a very small decoding error probability, the overall reliability is limited by the probability PG of deficient decoding, the term introduced by Jelinek to refer to decoding failures caused mainly by buffer overflow. The number of computational efforts in sequential decoding has the Pareto distribution and it is this "heavy tailed" distribution that characterizes PG. The heavy tailed distribution appears in many fields and buffer overflow is a typical example of the behaviors in which the heavy tailed distribution plays an important role. In this paper, we give a new bound on a probability in the tail of the heavy tailed distribution and, using the bound, prove the long-standing conjecture on PG, that is, PG ap constanttimes1/(sigmarhoNrho-1) for a large speed factor sigma of the decoder and for a large receive buffer size N whenever the coding rate R and rho satisfy E(rho)=rhoR for 0 les rho les 1

Published in:

IEEE Transactions on Information Theory  (Volume:51 ,  Issue: 3 )