Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

On suboptimum component decoding for product codes

Loncar, Maja LU ; Johannesson, Rolf LU ; Sayir, J ; Bocharova, Irina LU and Kudryashov, Boris LU (2006) IEEE International Symposium on Information Theory, 2006 p.2240-2244
Abstract
The performance and convergence behavior of the iterative schemes for decoding two-dimensional product codes are investigated. The decoding trajectories of the extrinsic and the a posteriori information are used as a main tool for predicting and explaining the behavior of the iterative decoding process. The component-wise optimal BCJR decoder is compared to the suboptimal max-log-MAP decoder and the list-based BEAST-APP decoder in terms of convergence and bit-error-rate performance. The results are illustrated by examples, which show that the BEAST-APP decoder achieves near-BCJR performance with significantly lower complexity
Please use this url to cite or link to this publication:
author
; ; ; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
bit-error-rate, suboptimal max-log-MAP decoder, iterative decoding process, two-dimensional product codes, iterative schemes, product codes, suboptimum component decoding
host publication
2006 IEEE International Symposium on Information Theory
pages
2240 - 2244
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE International Symposium on Information Theory, 2006
conference location
Seattle, WA, United States
conference dates
2006-07-09 - 2006-07-14
external identifiers
  • wos:000245289704059
  • scopus:39049105093
ISBN
1-4244-0504-1
DOI
10.1109/ISIT.2006.261965
language
English
LU publication?
yes
id
7e1383ed-a017-44f8-983d-dce61528d37f (old id 616802)
date added to LUP
2016-04-04 10:28:38
date last changed
2022-01-29 20:20:48
@inproceedings{7e1383ed-a017-44f8-983d-dce61528d37f,
  abstract     = {{The performance and convergence behavior of the iterative schemes for decoding two-dimensional product codes are investigated. The decoding trajectories of the extrinsic and the a posteriori information are used as a main tool for predicting and explaining the behavior of the iterative decoding process. The component-wise optimal BCJR decoder is compared to the suboptimal max-log-MAP decoder and the list-based BEAST-APP decoder in terms of convergence and bit-error-rate performance. The results are illustrated by examples, which show that the BEAST-APP decoder achieves near-BCJR performance with significantly lower complexity}},
  author       = {{Loncar, Maja and Johannesson, Rolf and Sayir, J and Bocharova, Irina and Kudryashov, Boris}},
  booktitle    = {{2006 IEEE International Symposium on Information Theory}},
  isbn         = {{1-4244-0504-1}},
  keywords     = {{bit-error-rate; suboptimal max-log-MAP decoder; iterative decoding process; two-dimensional product codes; iterative schemes; product codes; suboptimum component decoding}},
  language     = {{eng}},
  pages        = {{2240--2244}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  title        = {{On suboptimum component decoding for product codes}},
  url          = {{http://dx.doi.org/10.1109/ISIT.2006.261965}},
  doi          = {{10.1109/ISIT.2006.261965}},
  year         = {{2006}},
}