Change search
ReferencesLink to record
Permanent link

Direct link
Convergence analysis and optimal scheduling for multiple concatenated codes
Chalmers University of Technology.
University of South Australia. (Institute for Telecommunications Research)ORCID iD: 0000-0001-7182-9543
University of South Australia. (Institute for Telecommunication Research)
2005 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, Vol. 51, no 9, 3354-3364 p.Article in journal (Refereed) Published
Abstract [en]

An interesting practical consideration for decoding of serial or parallel concatenated codes with more than two components is the determination of the lowest complexity component decoder schedule which results in convergence. This correspondence presents an algorithm that finds such an optimal decoder schedule. A technique is also given for combining and projecting a series of three-dimensional extrinsic information transfer (EXIT) functions onto a single two-dimensional EXIT chart. This is a useful technique for visualizing the convergence threshold for multiple concatenated codes and provides a design tool for concatenated codes with more than two components.

Place, publisher, year, edition, pages
2005. Vol. 51, no 9, 3354-3364 p.
Keyword [en]
Exit chart, Iterative decoding, Multiple concatenated codes, Optimal scheduling
National Category
URN: urn:nbn:se:kth:diva-62633DOI: 10.1109/TIT.2005.853312ISI: 000231392900030OAI: diva2:480778
QC 20120124Available from: 2012-01-19 Created: 2012-01-19 Last updated: 2012-01-24Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Rasmussen, Lars Kildehöj
In the same journal
IEEE Transactions on Information Theory

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 10 hits
ReferencesLink to record
Permanent link

Direct link