Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

On suboptimum component decoding for product codes

Författare

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

Publiceringsår

2006

Språk

Engelska

Sidor

2240-2244

Publikation/Tidskrift/Serie

2006 IEEE International Symposium on Information Theory

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • 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/Övrigt

  • ISBN: 1-4244-0504-1