DocumentCode
379498
Title
Prunable S-random interleavers
Author
Ferrari, M. ; Scalise, F. ; Bellini, S.
Author_Institution
Dipt. di Elettronica e Inf., Politecnico di Milano, Italy
Volume
3
fYear
2002
fDate
2002
Firstpage
1711
Abstract
We propose a variation of the algorithm for the construction 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.
Keywords
concatenated codes; convolutional codes; interleaved codes; turbo codes; flexible block size; flexible rate; parallel concatenated convolutional codes; prunable S-random interleavers; serially concatenated codes; turbo codes; 3G mobile communication; Approximation algorithms; Concatenated codes; Convolutional codes; Degradation; Interleaved codes; Intrusion detection; Iterative algorithms; Iterative decoding; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2002. ICC 2002. IEEE International Conference on
Print_ISBN
0-7803-7400-2
Type
conf
DOI
10.1109/ICC.2002.997141
Filename
997141
Link To Document