In this paper we propose a variation of the algorithm for the costruction of "spread" or S-Random interleavers. This new version guarantees good spread properties that are also maintained under pruning. This makes this kind of interleaver attractive for those applications which require flexible size interleavers, such as flexible block size turbo codes, and flexible rate serially concatenated turbo codes.
Prunable S-Random Interleavers
M Ferrari;S Bellini
2002
Abstract
In this paper we propose a variation of the algorithm for the costruction of "spread" or S-Random interleavers. This new version guarantees good spread properties that are also maintained under pruning. This makes this kind of interleaver attractive for those applications which require flexible size interleavers, such as flexible block size turbo codes, and flexible rate serially concatenated turbo codes.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.
