Turbo codes: the phase transition
arXiv:cond-mat/0003218 · doi:10.1007/s100510070085
Abstract
Turbo codes are a very efficient method for communicating reliably through a noisy channel. There is no theoretical understanding of their effectiveness. In [1] they are mapped onto a class of disordered spin models. The analytical calculations concerning these models are reported here. We prove the existence of a no-error phase and compute its local stability threshold. As a byproduct, we gain some insight into the dynamics of the decoding algorithm.
26 pages, 3 eps figures
Cited by in corpus (11)
- Asymptotic Analysis of MAP Estimation via the Replica Method and Applications to Compressed Sensing
- Tight bounds for LDPC and LDGM codes under MAP decoding
- Analysis of CDMA systems that are characterized by eigenvalue spectrum
- The Dynamic Phase Transition for Decoding Algorithms
- Tighter Decoding Reliability Bound for Gallager's Error-Correcting Code
- On the genealogy of branching random walks and of directed polymers
- Asymptotic Performance Analysis of a K-Hop Amplify-and-Forward Relay MIMO Channel
- Statistical Mechanics and Capacity-Approaching Error-Correcting Codes
- On the Outage Capacity of Correlated Multiple-Path MIMO Channels
- Randomly Spread CDMA: Asymptotics via Statistical Physics
- Statistical mechanical analysis of a hierarchical random code ensemble in signal processing