By Topic

An upper bound on moments of sequential decoding effort

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
$31 $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)

In this paper we derive an infinite tree code ensemble upper bound on thenuth(nu leq 1)moments of the computational effort connected with sequential decoding governed by the Fano footnote[1]{algorithm}. It is shown that thenuth moment of the effort per decoded branch is hounded by a constant, provided the transmission rateR_{0}satisfies inequality (2), This result, although often conjectured, has previously been shown to hold only for positive integral values ofnu. For a wide class of discrete memoryless channels (that includes all symmetric channels), our bounds agree qualitatively with the lower bounds of Jacobs and Berlekamp [8].

Published in:

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