Estimating the Maximum a Posteriori Threshold for Serially Concatenated Turbo Codes
Résumé
We investigate the problem of estimating the maximum a posteriori (MAP) threshold for serially concatenated turbo codes. First, we provide a method to compute this MAP threshold using a numerical approximation of the EBP-GEXIT chart and the Maxwell construction. Second, we explore where the spatially coupled belief propagation (BP) threshold is located with respect to the previously computed MAP threshold and analyze the saturation phenomenon of such schemes. Simulation results indicate that the BP threshold of the spatially coupled turbo-codes saturates to the MAP threshold obtained using the EBP-GEXIT chart.