By Topic

On the BCJR Algorithm for Rate-Distortion Source Coding

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

3 Author(s)

The Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is an important channel decoding method. We extend it to trellis rate-distortion data compression. Beginning from source coding principles, the derivation of the algorithm avoids channel coding or soft output ideas. The encoder does not use entropy coding; equiprobable reproducer letters are emphasized since these maximize entropy. The BCJR method is demonstrated by tests of a tail-biting variant. It performs much better than the ordinary Viterbi algorithm for short and medium blocks. However, the improvement stems from tail biting; the role of the BCJR is to achieve tail biting in a relatively simple way. Some issues that arise with tail biting are explored. It is shown that there is an optimal trellis state size for each block length.

Published in:

Information Theory, IEEE Transactions on  (Volume:53 ,  Issue: 9 )