An importance sampling (IS) simulation of block codes based on the serial or parallel concatenation of simple codes is considered. At very low bit error rates, traditional Monte Carte simulations cannot be performed due to the very long simulation time that would be required. IS techniques can be very helpful in these cases. It is shown how IS can be applied to evaluate the performance of optimal MAP bit-per-bit decoders, and of non-optimal (turbo-like) iterative decoders.
Importance Sampling simulation of concatenated block codes
M Ferrari;S Bellini
2000
Abstract
An importance sampling (IS) simulation of block codes based on the serial or parallel concatenation of simple codes is considered. At very low bit error rates, traditional Monte Carte simulations cannot be performed due to the very long simulation time that would be required. IS techniques can be very helpful in these cases. It is shown how IS can be applied to evaluate the performance of optimal MAP bit-per-bit decoders, and of non-optimal (turbo-like) iterative decoders.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.
