Optimal scheduling for multiple serially concatenated codes
Paper i proceeding, 2003

In this paper an algorithm is proposed that finds the optimal activation schedule for the component decoders for iterative decoding of systems with three or more serially concatenated codes. It is optimal in terms of minimizing the total decoding complexity required to reach the convergence point. It is also demonstrated that the convergence threshold can be found by combining several three-dimensional extrinsic information transfer (EXIT) surfaces into one two-dimensional EXIT chart.

multiple concatenated codes

EXIT charts

Iterative decoding

optimal scheduling

Författare

Fredrik Brännström

Chalmers, Institutionen för datorteknik

Lars K. Rasmussen

Alex Grant

International Symposium on Turbo Codes and Related Topics, Brest, France, Sept. 2003

383–-386

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Telekommunikation