Interleaver properties and their applications to the trellis complexity analysis of turbo codes

DOI10.1109/26.923803zbMATH Open1012.94023OpenAlexW2154812632MaRDI QIDQ4552986FDOQ4552986

Authors: R. Garello, Guido Montorsi, Sergio Benedetto, Giovanni Cancellieri 

Publication date: 1 December 2002

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e96d59c1a43a0429950150cc39360ccf0bdb3175

Recommendations

• Design of interleavers for turbo codes: iterative interleaver growth algorithms of polynomial complexity
• New deterministic interleaver designs for turbo codes
• scientific article; zbMATH DE number 2059737
• Variance of the turbo code performance bound over the interleavers
• On quasi-cyclic interleavers for parallel turbo codes
• scientific article; zbMATH DE number 2186059
• Interleavers for turbo codes using permutation polynomials over integer rings
• Permutation polynomial interleavers for turbo codes
• Interleaver Pruning for Construction of Variable-Length Turbo Codes
• Design of two step deterministic interleaver for turbo codes

zbMATH Keywords

trellis complexityconcatenated codesturbo codesinterleavers

Mathematics Subject Classification ID

Decoding (94B35) Other types of codes (94B60) Error probability in coding theory (94B70)

Cited In (5)

• Permutations in two dimensions that maximally separate neighbors
• Blind detection of interleaver parameters
• Interleavers for turbo codes using permutation polynomials over integer rings
• Variance of the turbo code performance bound over the interleavers
• The super-trellis structure of turbo codes

This page was built for publication: Interleaver properties and their applications to the trellis complexity analysis of turbo codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4552986)