On suboptimum component decoding for product codes

Maja Loncar, Rolf Johannesson, J Sayir, Irina Bocharova, Boris Kudryashov

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

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
Original languageEnglish
Title of host publication2006 IEEE International Symposium on Information Theory
PublisherIEEE - Institute of Electrical and Electronics Engineers Inc.
Pages2240-2244
ISBN (Print)1-4244-0504-1
DOIs
Publication statusPublished - 2006
EventIEEE International Symposium on Information Theory, 2006 - Seattle, Seattle, WA, United States
Duration: 2006 Jul 92006 Jul 14

Conference

ConferenceIEEE International Symposium on Information Theory, 2006
Abbreviated titleISIT06
Country/TerritoryUnited States
CitySeattle, WA
Period2006/07/092006/07/14

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • bit-error-rate
  • suboptimal max-log-MAP decoder
  • iterative decoding process
  • two-dimensional product codes
  • iterative schemes
  • product codes
  • suboptimum component decoding

Fingerprint

Dive into the research topics of 'On suboptimum component decoding for product codes'. Together they form a unique fingerprint.

Cite this