Convergence behavior of iteratively decoded parallel concatenated codes

By Stephan ten Brink. IEEE Transactions on Communications, 2001

2,558 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/157235ae3b7703461956a5509b84b9ed60e662cf

How researchers see this paper

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

In Artificial Intelligence

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs (2015, background): “Yet another important contribution to IDD design is the extrinsic information transfer (EXIT) chart invented by ten Brink [565], [566], which is a powerful tool conceived not only for analyzing the convergence behavior of iterative receivers, but also for assisting nearcapacity wireless system desig”
Wireless Information-Theoretic Security (2008, methodology): “There is no closed-form expression neither for the EXIT curve of the demapper characterized by (22) nor for the LDPC EXIT curve for 100 iterations; however, they can be obtained via Monte Carlo simulations assuming Gaussian a priori information [47].”
Iterative Channel Estimation Using LSE and Sparse Message Passing for MmWave MIMO Systems (2016, methodology): “The main difference is that we take the variances of variable nodes as the extrinsic information, while the paper [57] uses the mutual information as the extrinsic information, and the paper [63] uses the MSE as the extrinsic information.”
Channel Estimation for OFDM (2014, methodology): “Although EXIT chart or density evolution can be used to explain the performance of the receiver in [103], [105], [165] and [166], there is still no analytical explanation on the behavior of the factor graph receiver when there are loops in the graph [115], [126].”
Design of low-density parity-check codes for modulation and detection (2004, methodology): “(4) where the functions and are given in the Appendix (see also [6]).”
Turbo equalization: principles and new results (2002, methodology): “This is done in [35] and [36] by observing the histogram of the outputted LLRs to estimate the pdf of and then computing numerically using (17).”
Belief Propagation, Dykstra's Algorithm, and Iterated Information Projections (2010, background): “Additional terrain has been charted with extensions to continuous probability distributions using expectation propagation [16], [9], which encompasses belief propagation in particular settings.”
Iterative multiuser joint decoding: unified framework and asymptotic analysis (2001, positive): “Next, we propose a Gaussian approximation of the SISO decoder output [32]‐[ 34 ], which makes the iterative computation of very simple.”
Extrinsic information transfer functions: model and erasure channel properties (2004, background): “We define two quantities (see also [13]–[16]), namely”
Probabilistic Constellation Shaping for Optical Fiber Communications (2019, background): “, density evolution [11] or extrinsic information transfer (EXIT) chart analyses [47], to approach the (modulation-constrained) AIR.”
Protograph LDPC Codes Design Based on EXIT Analysis (2007, background): “J(σ) represents the capacity of a binaryinput additive Gaussian noise channel, and it is given by [1]”
Bit-Interleaved Coded Modulation (2008, methodology): “In the original EXIT charts proposed by ten Brink [116, 117, 119], the extrinsic channel was modeled as a binary-input AWGN channel with an equivalent SNR given by snr ap = C −1 bpsk(x) (5.”
Orthogonal AMP (2016, background): “The latter bears similarity to density evolution [5] (including EXIT analysis [6]) for message passing decoding algorithms.”