On the BCJR algorithm for rate-distortion source coding
(2005) IEEE International Symposium on Information Theory (ISIT), 2005 2005. p.1932-1936- Abstract
- The BCJR algorithm is an important method of channel decoding. We extend it here to rate-distortion encoding. The arguments begin from source coding principles and make no use of channel coding or soft output ideas. An important role is played by codeword ensembles with equiprobable reproducer letters. The BCJR method is demonstrated by tests of a tailbiting BCJR with the Gaussian source. The outcome improves Viterbi algorithm performance at short and medium blocklengths.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/615470
- author
- Anderson, John B LU ; Goertz, Norbert and Eriksson, Tomas LU
- organization
- publishing date
- 2005
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- Channel coding, Viterbi algorithms, Channel decoding, Gaussian source
- host publication
- IEEE International Symposium on Information Theory - Proceedings
- volume
- 2005
- pages
- 1932 - 1936
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- IEEE International Symposium on Information Theory (ISIT), 2005
- conference location
- Adelaide, Australia
- conference dates
- 2005-09-04 - 2005-09-09
- external identifiers
-
- wos:000234713801151
- scopus:33749441156
- DOI
- 10.1109/ISIT.2005.1523682
- language
- English
- LU publication?
- yes
- id
- 377976ae-b023-4c57-91b2-614556bb1052 (old id 615470)
- date added to LUP
- 2016-04-04 10:22:25
- date last changed
- 2022-01-29 20:09:59
@inproceedings{377976ae-b023-4c57-91b2-614556bb1052, abstract = {{The BCJR algorithm is an important method of channel decoding. We extend it here to rate-distortion encoding. The arguments begin from source coding principles and make no use of channel coding or soft output ideas. An important role is played by codeword ensembles with equiprobable reproducer letters. The BCJR method is demonstrated by tests of a tailbiting BCJR with the Gaussian source. The outcome improves Viterbi algorithm performance at short and medium blocklengths.}}, author = {{Anderson, John B and Goertz, Norbert and Eriksson, Tomas}}, booktitle = {{IEEE International Symposium on Information Theory - Proceedings}}, keywords = {{Channel coding; Viterbi algorithms; Channel decoding; Gaussian source}}, language = {{eng}}, pages = {{1932--1936}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{On the BCJR algorithm for rate-distortion source coding}}, url = {{http://dx.doi.org/10.1109/ISIT.2005.1523682}}, doi = {{10.1109/ISIT.2005.1523682}}, volume = {{2005}}, year = {{2005}}, }