Iterative multiuser joint decoding: unified framework and asymptotic analysis

By Joseph Jean Boutros, Giuseppe Caire. Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), 2001

338 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/f62b7bb5abc92bbc2fca045c053a5f02c645a9b6

How researchers see this paper

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

Citations in the corpus

Sparse Solution Of Underdetermined Linear Equations By Stagewise Orthogonal Matching Pursuit (2006, methodology): “onion-peeling schemes [10] or iterative decoders [4, 6, 13] - is completely consistent with our approach in this paper: stagewise least-squares projection when the nonzeros in x0 have a power-law distribution is something like onion-peeling; `1 minimization is something like a Bayesian maximum a pos”
Generalized approximate message passing for estimation with random linear mixing (2010, methodology): “Prior to their work, analyses of approximate BP algorithms were based on either heuristic arguments such as [8], [9], [13], [14] or certain large sparse limit assumptions for the matrix A [2], [10], [11], [15], [16].”
Bit-Interleaved Coded Modulation (2008, methodology): “Furthermore, we have then the following concentration theorem [22, 60,96,97]:”
Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit (2012, methodology): “, onion-peeling schemes [10] or iterative decoders [4], [6], [13]—is completely consistent with our approach in this paper: stagewise least-squares projection when the nonzeros in have a power-law distribution is something like onion-peeling; minimization is something like a Bayesian maximum a poste”
Novel Low-Density Signature for Synchronous CDMA Systems Over AWGN Channel (2008, methodology): “Furthermore, inspired by our investigation above and the recent success of the low-density parity check (LDPC) codes, devised in [32], we propose a novel low-density signature (LDS) structure that follows the parity-check matrix in LDPC codes.”
Belief Propagation, Dykstra's Algorithm, and Iterated Information Projections (2010, background): “Further validation followed with the resurrection [5] of low density parity check codes [6], and in relatively short time successful applications of belief propagation have been reported in network diagnostics [7], sensor self-localization [8], distributed inference in sensor networks [9], [10], and”
On the Effectiveness of OTFS for Joint Radar Parameter Estimation and Communication (2020, methodology): “For this reason, the authors of [25] propose to use a Gaussian approximation of the interfering symbols in the computation at the nodes Qi (x), which effectively boils down to a soft interference cancellation approach, as already widely used in turbo equalization and pioneered in the context of mult”