The iterative turbo decoding algorithm has fixed points

DOI10.1109/18.959276MaRDI QIDQ4544741zbMATH OpenOpenAlexFDO

Authors Long Duan, Bixio Rimoldi

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.959276

zbMATH Keywords

fixed pointsiterative decodingturbo codes

Mathematics Subject Classification ID

Decoding (94B35) Other types of codes (94B60)

Recommendations

• The turbo decoding algorithm and its phase trajectories
• Analyzing the turbo decoder using the Gaussian approximation
• Iterative decoding of concatenated codes: a tutorial
• The geometry of turbo-decoding dynamics
• Turbo Decoding as Iterative Constrained Maximum-Likelihood Sequence Detection

Cited in

(3)

• The geometry of turbo-decoding dynamics
• The turbo decoding algorithm and its phase trajectories
• CHAOS AND CONTROL OF TRANSIENT CHAOS IN TURBO-DECODING ALGORITHMS

This page was built for publication: The iterative turbo decoding algorithm has fixed points

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