Convergence analysis and optimal scheduling for multiple concatenated codes
Journal article, 2005

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.

optimal scheduling.

iterative decoding

EXIT chart

multiple concatenated codes

Author

Fredrik Brännström

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Lars K. Rasmussen

Chalmers

University of South Australia

Alex J. Grant

University of South Australia

IEEE Transactions on Information Theory

0018-9448 (ISSN)

Vol. 51 9 3354–-3364

Areas of Advance

Information and Communication Technology

Subject Categories

Telecommunications

DOI

10.1109/TIT.2005.853312

More information

Latest update

9/10/2018