On suboptimum component decoding for product codes

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

doi:10.1109/ISIT.2006.261965

On suboptimum component decoding for product codes

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

Institutionen för elektro- och informationsteknik

Forskningsoutput: Kapitel i bok/rapport/Conference proceeding › Konferenspaper i proceeding › Peer review

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

Originalspråk	engelska
Titel på värdpublikation	2006 IEEE International Symposium on Information Theory
Förlag	IEEE - Institute of Electrical and Electronics Engineers Inc.
Sidor	2240-2244
ISBN (tryckt)	1-4244-0504-1
DOI	https://doi.org/10.1109/ISIT.2006.261965
Status	Published - 2006
Evenemang	IEEE International Symposium on Information Theory, 2006 - Seattle, Seattle, WA, USA Varaktighet: 2006 juli 9 → 2006 juli 14

Konferens

Konferens	IEEE International Symposium on Information Theory, 2006
Förkortad titel	ISIT06
Land/Territorium	USA
Ort	Seattle, WA
Period	2006/07/09 → 2006/07/14

Ämnesklassifikation (UKÄ)

Elektroteknik och elektronik

Tillgång till dokument

10.1109/ISIT.2006.261965

Citera det här

@inproceedings{7e1383eda01744f8983ddce61528d37f,

title = "On suboptimum component decoding for product codes",

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",

keywords = "bit-error-rate, suboptimal max-log-MAP decoder, iterative decoding process, two-dimensional product codes, iterative schemes, product codes, suboptimum component decoding",

author = "Maja Loncar and Rolf Johannesson and J Sayir and Irina Bocharova and Boris Kudryashov",

year = "2006",

doi = "10.1109/ISIT.2006.261965",

language = "English",

isbn = "1-4244-0504-1",

pages = "2240--2244",

booktitle = "2006 IEEE International Symposium on Information Theory",

publisher = "IEEE - Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "IEEE International Symposium on Information Theory, 2006, ISIT06 ; Conference date: 09-07-2006 Through 14-07-2006",

}

Loncar, M, Johannesson, R, Sayir, J, Bocharova, I & Kudryashov, B 2006, On suboptimum component decoding for product codes. i 2006 IEEE International Symposium on Information Theory. IEEE - Institute of Electrical and Electronics Engineers Inc., s. 2240-2244, IEEE International Symposium on Information Theory, 2006, Seattle, WA, USA, 2006/07/09. https://doi.org/10.1109/ISIT.2006.261965

TY - GEN

T1 - On suboptimum component decoding for product codes

AU - Loncar, Maja

AU - Johannesson, Rolf

AU - Sayir, J

AU - Bocharova, Irina

AU - Kudryashov, Boris

PY - 2006

Y1 - 2006

N2 - 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

AB - 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

KW - bit-error-rate

KW - suboptimal max-log-MAP decoder

KW - iterative decoding process

KW - two-dimensional product codes

KW - iterative schemes

KW - product codes

KW - suboptimum component decoding

U2 - 10.1109/ISIT.2006.261965

DO - 10.1109/ISIT.2006.261965

M3 - Paper in conference proceeding

SN - 1-4244-0504-1

SP - 2240

EP - 2244

BT - 2006 IEEE International Symposium on Information Theory

PB - IEEE - Institute of Electrical and Electronics Engineers Inc.

T2 - IEEE International Symposium on Information Theory, 2006

Y2 - 9 July 2006 through 14 July 2006

ER -

On suboptimum component decoding for product codes

Sammanfattning

Konferens

Ämnesklassifikation (UKÄ)

Tillgång till dokument

Fingeravtryck

Citera det här