Importance sampling simulation of turbo product codes

An importance sampling technique, tuned for the simulation of ideal or suboptimal MAP bit-per-bit decoding, is applied to some examples of turbo product codes, i.e. to turbo decoding of the product of block codes. The simulation results show the remarkable performances of the suboptimal algorithms. The presence of the so called "knee" in the performance curves, predicted by the maximum likelihood asymptotic bound, is also confirmed.