CCS

Iterative Decoding for Turbo Codes

We have seen that optimal decoding of turbo codes is impossible due to the large number
of states in the code trellis. A suboptimal iterative decoding algorithm, known
as the turbo decoding algorithm, was proposed by Berrou et al. (1993) and achieves
excellent performance very close to the theoretical bound predicted by Shannon.

 

 

Reference,

　　1. <<Contemporary Communication System using MATLAB>> - John G. Proakis