Advanced

On the BCJR algorithm for rate-distortion source coding

Anderson, John B LU ; Eriksson, Tomas LU and Goertz, Norbert (2007) In IEEE Transactions on Information Theory 53(9). p.3201-3207
Abstract
The 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 tailbiting variant. It performs much better than the ordinary Viterbi algorithm for short and medium blocks. However, the improvement stems from tailbiting; the role of the BCJR is to achieve tailbiting in a relatively simple way. Some issues that arise with tailbiting are explored. It is shown that there is an... (More)
The 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 tailbiting variant. It performs much better than the ordinary Viterbi algorithm for short and medium blocks. However, the improvement stems from tailbiting; the role of the BCJR is to achieve tailbiting in a relatively simple way. Some issues that arise with tailbiting are explored. It is shown that there is an optimal trellis state size for each block length. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
source codes, rate-distortion coding, BCJR algorithm, data compression
in
IEEE Transactions on Information Theory
volume
53
issue
9
pages
3201 - 3207
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • wos:000249025100017
  • scopus:65349119875
ISSN
0018-9448
DOI
10.1109/TIT.2007.903146
project
PCC: Algorithm and Hardware
language
English
LU publication?
no
id
383316aa-0a10-4e83-beb3-29419333623b (old id 617699)
date added to LUP
2007-11-22 10:08:15
date last changed
2017-01-01 06:38:59
@article{383316aa-0a10-4e83-beb3-29419333623b,
  abstract     = {The BCJR algorithm is an important channel decoding method. We extend it to trellis rate-distortion data<br/><br>
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; <br/><br>
equiprobable reproducer letters are emphasized since<br/><br>
these maximize entropy. The BCJR method is demonstrated by<br/><br>
tests of a tailbiting variant. It performs much better than the ordinary Viterbi algorithm for short and medium blocks. However, the improvement stems from tailbiting; the role of the BCJR is to achieve tailbiting in a relatively simple way. Some issues that arise with tailbiting are explored. It is shown that there is an optimal trellis state size for each block length.},
  author       = {Anderson, John B and Eriksson, Tomas and Goertz, Norbert},
  issn         = {0018-9448},
  keyword      = {source codes,rate-distortion coding,BCJR algorithm,data compression},
  language     = {eng},
  number       = {9},
  pages        = {3201--3207},
  publisher    = {IEEE--Institute of Electrical and Electronics Engineers Inc.},
  series       = {IEEE Transactions on Information Theory},
  title        = {On the BCJR algorithm for rate-distortion source coding},
  url          = {http://dx.doi.org/10.1109/TIT.2007.903146},
  volume       = {53},
  year         = {2007},
}