The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

On the BCJR algorithm for rate-distortion source coding

På svenska

Author

Summary, in English

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.

Publishing year

2007

Language

English

Pages

3201-3207

Publication/Series

IEEE Transactions on Information Theory

Volume

53

Issue

9

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • source codes
  • rate-distortion coding
  • BCJR algorithm
  • data compression

Status

Published

Project

  • PCC: Algorithm and Hardware

Research group

  • Informations- och kommunikationsteori

ISBN/ISSN/Other

  • ISSN: 0018-9448