Interleaver Pruning for Construction of Variable-Length Turbo Codes

DOI10.1109/TIT.2004.824914MaRDI QIDQ3546764zbMATH OpenFDO

Authors Fred Daneshgaran, Paolo Mulassano

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2004.824914

Mathematics Subject Classification ID

Cyclic codes (94B15)

Recommendations

• Design of interleavers for turbo codes: iterative interleaver growth algorithms of polynomial complexity
• Optimized turbo codes for delay constrained applications
• Design of parallel concatenated convolutional codes
• On quasi-cyclic interleavers for parallel turbo codes
• New deterministic interleaver designs for turbo codes

Cited in

(3)

• Optimized turbo codes for delay constrained applications
• Interleaver properties and their applications to the trellis complexity analysis of turbo codes
• Variance of the turbo code performance bound over the interleavers

This page was built for publication: Interleaver Pruning for Construction of Variable-Length Turbo Codes

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