Meny

Du är här

On suboptimum component decoding for product codes

Författare:
Publiceringsår: 2006
Språk: Engelska
Sidor: 2240-2244
Publikation/Tidskrift/Serie: 2006 IEEE International Symposium on Information Theory
Dokumenttyp: Konferensbidrag
Förlag: IEEE Press

Sammanfattning

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

Disputation

Nyckelord

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

Övriga

2006 IEEE International Symposium on Information Theory
9-14 July 2006
Seattle, WA, USA
Published
Yes
  • ISBN: 1-4244-0504-1

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen