Optimal scheduling for iterative decoding
Paper in 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.

Author

Fredrik Brännström

Chalmers, Department of Computer Engineering

Lars K. Rasmussen

Alex Grant

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

350-
0-7803-7728-1 (ISBN)

Areas of Advance

Information and Communication Technology

Subject Categories

Telecommunications

DOI

10.1109/ISIT.2003.1228365

ISBN

0-7803-7728-1

More information

Created

10/7/2017