Convergence analysis and optimal scheduling for multiple concatenated codes
2005 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, Vol. 51, no 9, 3354-3364 p.Article in journal (Refereed) Published
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.
Exit chart, Iterative decoding, Multiple concatenated codes, Optimal scheduling
IdentifiersURN: urn:nbn:se:kth:diva-62633DOI: 10.1109/TIT.2005.853312ISI: 000231392900030OAI: oai:DiVA.org:kth-62633DiVA: diva2:480778
QC 201201242012-01-192012-01-192012-01-24Bibliographically approved