Yoshiyuki Kabashima

A CDMA multiuser detection algorithm on the basis of belief propagation

An iterative algorithm for the multiuser detection problem that arises in code division multiple access (CDMA) systems is developed on the basis of Pearls belief propagation (BP). We show that the BP-based algorithm exhibits nearly optimal performance in a practical time scale by utilizing the central limit theorem and self-averaging property appropriately, whereas direct application of BP to the detection problem is computationally difficult and far from practical. We further present close relationships of the proposed algorithm to the Thouless–Anderson–Palmer approach and replica analysis known in spin-glass research.

A typical reconstruction limit for compressed sensing based on Lp-norm minimization

We consider the problem of reconstructing an

Analysis of CDMA systems that are characterized by eigenvalue spectrum

N

Statistical mechanics of low-density parity-check codes

-dimensional continuous vector

Statistical physics of regular low-density parity-check error-correcting codes

\bx

Typical performance of gallager-type error-correcting codes

from

Phase Transitions and Sample Complexity in Bayes-Optimal Matrix Factorization

P

Analysis of Regularized LS Reconstruction and Random Matrix Ensembles in Compressed Sensing

constraints which are generated by its linear transformation under the assumption that the number of non-zero elements of

Signal recovery using expectation consistent approximation for linear observations

\bx

Tighter decoding reliability bound for Gallager's error-correcting code

is typically limited to