The geometry of turbo-decoding dynamics

DOI10.1109/18.817505MaRDI QIDQ4503505zbMATH OpenOpenAlexFDO

Authors T. J. Richardson

Publication date 7 September 2000

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

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

zbMATH Keywords

geometrymaximum-likelihood decodingturbo codesturbo-decoding algorithm

Mathematics Subject Classification ID

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

Recommendations

• Information Geometry of Turbo and Low-Density Parity-Check Codes
• Convergence analysis of turbo decoding of product codes
• The iterative turbo decoding algorithm has fixed points
• The turbo decoding algorithm and its phase trajectories
• Coding theorems for turbo code ensembles

Cited in

(13)

• Geometry of optimal estimation scheme forSU(D) channels
• The Locking-Decoding Frontier for Generic Dynamics
• Stochastic Analysis of Turbo Decoding
• Information Geometry of Turbo and Low-Density Parity-Check Codes
• The turbo decoding algorithm and its phase trajectories
• Convergence analysis of turbo decoding of product codes
• The iterative turbo decoding algorithm has fixed points
• scientific article; zbMATH DE number 2154514 (Why is no real title available?)
• CHAOS AND CONTROL OF TRANSIENT CHAOS IN TURBO-DECODING ALGORITHMS
• Existence and uniqueness of the solution for turbo decoding of parallel concatenated single parity check codes
• Stochastic Reasoning, Free Energy, and Information Geometry
• STUDY OF BIFURCATION BEHAVIOR OF LDPC DECODERS
• Estimation and Marginalization Using the Kikuchi Approximation Methods

This page was built for publication: The geometry of turbo-decoding dynamics

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