Optimized turbo codes for delay constrained applications

DOI10.1109/18.971759MaRDI QIDQ4544786zbMATH OpenOpenAlexFDO

Authors Fred Daneshgaran, Marina Mondin

Publication date 4 August 2002

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

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

Mathematics Subject Classification ID

Convolutional codes (94B10) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• Design of interleavers for turbo codes: iterative interleaver growth algorithms of polynomial complexity
• Design of parallel concatenated convolutional codes
• Interleaver Pruning for Construction of Variable-Length Turbo Codes
• Some results concerning the design and decoding of turbo-codes
• Turbo-encoder design for symbol-interleaved parallel concatenated trellis-coded modulation

Cited in

(3)

• On the frame-error rate of concatenated turbo codes
• Stream-oriented turbo codes
• Interleaver Pruning for Construction of Variable-Length Turbo Codes

This page was built for publication: Optimized turbo codes for delay constrained applications

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