Designing Iterative Decoding Schemes with the Extrinsic Information Transfer Chart

By G. Fischer, Stephan ten Brink. 2001

351 citations recorded by the source corpus.

How researchers see this paper

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

Spatially coupled ensembles universally achieve capacity under belief propagation (2012, background): “Since all the distributions of interest are symmetric, it sufﬁces to look at the | D | -domain instead of the D -domain. however, we To ease our notation, will formally write expressions like d ( a , b ) , i.e., we will allow the arguments to be e.g.”
A close-to-capacity dirty paper coding scheme (2004, background): “Details on how to compute EXIT curves for various APP processing blocks and a priori distributions can be found in [33], [30].”
Rate-adaptive codes for distributed source coding (2006, methodology): “The latter addressed the design of the codes and puncturing via EXIT chart analysis [15].”
Convergence behavior of iteratively decoded parallel concatenated codes (2001, background): “This interpretation turns out to be particularly useful for serially concatenated coding schemes like presented in [10], [23] where mutual information characterizes the properties of different constellation mappings.”