Optimal scheduling for multiple serially concatenated codes

Paper in 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.