By Topic

On memory redundancy in the BCJR algorithm for nonrecursive shift register processes

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

2 Author(s)
M. Schmidt ; Tech. Univ. Dresden, Germany ; G. P. Fettweis

For computation of a posteriori probabilities (APPs), the well-known Bahl, Cocke, Jelinek, and Raviv (1974) algorithm is often applied. If the underlying model is a nonrecursive shift register process, it is shown that this algorithm obtains a general memory redundancy if the computation is performed over a commutative semiring with an absorbing zero element. The result is of particular interest for the BCJR algorithm carried out in the max-log domain

Published in:

IEEE Transactions on Information Theory  (Volume:46 ,  Issue: 4 )