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 Asymptote bound, is also confirmed.
Importance Sampling simulation of Turbo Product Codes
M Ferrari;S Bellini
2001
Abstract
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 Asymptote bound, is also confirmed.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
