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 suboptimum component decoding for product codes

På svenska

Author

Summary, in English

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

Publishing year

2006

Language

English

Pages

2240-2244

Publication/Series

2006 IEEE International Symposium on Information Theory

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • 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

Conference name

IEEE International Symposium on Information Theory, 2006

Conference date

2006-07-09 - 2006-07-14

Conference place

Seattle, WA, United States

Status

Published

ISBN/ISSN/Other

  • ISBN: 1-4244-0504-1