Stochastic reasoning, free energy, and information geometry
Neural Computation
Estimation and Marginalization Using the Kikuchi Approximation Methods
Neural Computation
Iterative decoding of concatenated codes: a tutorial
EURASIP Journal on Applied Signal Processing
Convergence analysis of turbo decoding of serially concatenated block codes and product codes
EURASIP Journal on Applied Signal Processing
Carrier and clock recovery in (turbo-) coded systems: Cramér-Rao bound and synchronizer performance
EURASIP Journal on Applied Signal Processing
Improved random redundant iterative HDPC decoding
IEEE Transactions on Communications
IEEE Transactions on Information Theory
Use of extrinsic information transfer chart to predict behavior of turbo codes
WTS'09 Proceedings of the 2009 conference on Wireless Telecommunications Symposium
An improved method for the convergence of iterative detection in turbo-CPM system
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Improved iteratively detected receiver for SCCPM system over ISI channels
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Message quantization in belief propagation: structural results in the low-rate regime
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Dynamics of analog decoders for different message representation domains
IEEE Transactions on Communications
Belief propagation, Dykstra's algorithm, and iterated information projections
IEEE Transactions on Information Theory
Semi-analytical performance prediction methods for iterative MMSE-IC multiuser MIMO joint decoding
IEEE Transactions on Communications
Loopy belief propagation for approximate inference: an empirical study
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Application of Extrinsic Information Transfer Charts to Anticipate Turbo Code Behavior
International Journal of Interdisciplinary Telecommunications and Networking
| Hi-index | 754.96 |
The spectacular performance offered by turbo codes sparked intense interest in them. A considerable amount of research has simplified, formalized, and extended the ideas inherent in the original turbo code construction. Nevertheless, the nature of the relatively simple ad hoc turbo-decoding algorithm has remained something of a mystery. We present a geometric interpretation of the turbo-decoding algorithm. The geometric perspective clearly indicates the relationship between turbo-decoding and maximum-likelihood decoding. Analysis of the geometry leads to new results concerning existence of fixed points, conditions for uniqueness, conditions for stability, and proximity to maximum-likelihood decoding