Precision Issues in the implementation of BCJR decoders
(2001) IEEE International Symposium on Information Theory (ISIT), 2001 p.289-289- Abstract
- The BCJR algorithm is a symbol-bysymbol soft-output MAP decoder for trellis codes. This paper studies the effect of wordlength variations on the BCJR performance and looks at two strategies for reducing the wordlength.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1225599
- author
- Thorén, Karl LU ; Öwall, Viktor LU and Anderson, John B LU
- organization
- publishing date
- 2001
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- [Host publication title missing]
- pages
- 289 - 289
- conference name
- IEEE International Symposium on Information Theory (ISIT), 2001
- conference location
- Washington, DC, United States
- conference dates
- 2001-06-24 - 2001-06-29
- external identifiers
-
- scopus:0034864035
- ISBN
- 0-7803-7123-2
- DOI
- 10.1109/ISIT.2001.936152
- language
- English
- LU publication?
- yes
- id
- 2857c183-fea2-4abf-ba82-39503291f727 (old id 1225599)
- date added to LUP
- 2016-04-04 13:24:57
- date last changed
- 2022-01-30 00:13:41
@inproceedings{2857c183-fea2-4abf-ba82-39503291f727, abstract = {{The BCJR algorithm is a symbol-bysymbol soft-output MAP decoder for trellis codes. This paper studies the effect of wordlength variations on the BCJR performance and looks at two strategies for reducing the wordlength.}}, author = {{Thorén, Karl and Öwall, Viktor and Anderson, John B}}, booktitle = {{[Host publication title missing]}}, isbn = {{0-7803-7123-2}}, language = {{eng}}, pages = {{289--289}}, title = {{Precision Issues in the implementation of BCJR decoders}}, url = {{https://lup.lub.lu.se/search/files/6114312/1227781}}, doi = {{10.1109/ISIT.2001.936152}}, year = {{2001}}, }