Convergence analysis and optimal scheduling for multiple concatenated codes
Artikel i vetenskaplig tidskrift, 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.

multiple concatenated codes

EXIT chart

iterative decoding

Författare

Fredrik Brännström

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Lars K. Rasmussen

University of South Australia

Chalmers University of Technology

Alex J. Grant

University of South Australia

IEEE Transactions on Information Theory

0018-9448 (ISSN)

Vol. 51 3354–-3364

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Telekommunikation

DOI

10.1109/TIT.2005.853312