Analyzing the turbo decoder using the Gaussian approximation

By Hesham El Gamal, A. Roger Hammons Jr.. 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 2000

387 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/764f174f1c2e92f5751590f1d6ed4773bb16af45

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

The art of error correcting coding (2002, background): “First introduced by Elias (1955), binary convolutional codes are one of the most popular forms of binary error correcting codes that have found numerous applications: wireless communications (IMT-2000, GSM, IS-95), digital terrestrial and satellite communication and broadcasting systems and space co”
Designing Iterative Decoding Schemes with the Extrinsic Information Transfer Chart (2001, background): “In [11], [12] the convergence of iterative decoders is studied based on signal to noise ratio measures.”
Sparse Solution Of Underdetermined Linear Equations By Stagewise Orthogonal Matching Pursuit (2006, methodology): “Finally the specific analysis technique we have developed – the conditioned Gaussian limit – bears some resemblance to density evolution schemes used in the MUD/CDMA literature, eg [4, 6, 13, 30].”
Design of low-density parity-check codes for modulation and detection (2004, methodology): “be possible using other chart techniques, see, e.g., [5], [7], and [ 8 ].”
Iterative multiuser joint decoding: unified framework and asymptotic analysis (2001, neutral): “As in (51), we make a Gaussian approximation of the SISO decoder output and let [32], [33]”
Raptor codes on binary memoryless symmetric channels (2006, methodology): “Then, we will show in Section V that the method of Gaussian approximation [17], [18] can be adapted to the case of Raptor codes.”
On the construction of some capacity-approaching coding schemes (2000, methodology): “Since there is no simple formula for updating message densities for turbo decoding, Monte Carlo simulations were used to analyze approximate trajectories for Gaussian messages under turbo decoding in both papers [64, 16].”
Iterative turbo decoder analysis based on density evolution (2000, methodology): “El Gamal, in his dissertation [4] and with Hammons [5], considered the SISO module in turbo decoders as a signal-to-noise ratio (SNR) transformer, and also suggested a method for analyzing the overall turbo decoder.”
Convergence behavior of iteratively decoded parallel concatenated codes (2001, background): “The authors of [7], [8] study the convergence of iterative decoders”
Turbo equalization: principles and new results (2002, methodology): “The algorithms for the approximate MMSE LE’s (I) and (II) can be implemented in the frequency domain [30], which further decreases the computational load for specific systems.”