Optimal scheduling for iterative decoding
Paper i proceeding, 2003

We propose an algorithm for finding the optimal decoder activation order in a system with more than two concatenated codes. Optimality is de- fined as the order that yields convergence using the lowest computational complexity, guided by the extrinsic information transfer (EXIT) charts of the component codes. We also describe how the convergence threshold for the system can be visualized by combining several multi-dimensional EXIT charts into one two-dimensional EXIT chart.

Författare

Fredrik Brännström

Chalmers, Institutionen för datorteknik

Lars K. Rasmussen

Alex Grant

IEEE International Symposium on Information Theory (ISIT '03), Yokohama, Japan, June/July 2003

350-

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Telekommunikation

DOI

10.1109/ISIT.2003.1228365

ISBN

0-7803-7728-1