A family of likelihood ascent search multiuser detectors: approaching optimum performance via random multicodes with linear complexity

Authors:
Yi Sun
Affiliations:
Department of Electrical Engineering, City College of the City University of New York, New York, NY
Venue:
IEEE Transactions on Communications
Year:
2009

Citing 7
Cited 1

Multiuser Detection

Multiuser Detection
A family of likelihood ascent search multiuser detectors: an upper bound of bit error rate and a lower bound of asymptotic multiuser efficiency

IEEE Transactions on Communications
Linear multiuser receivers: effective interference, effective bandwidth and user capacity

IEEE Transactions on Information Theory
Optimum asymptotic multiuser efficiency of randomly spread CDMA

IEEE Transactions on Information Theory
A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors

IEEE Transactions on Information Theory
Asymptotic normality of linear multiuser receiver outputs

IEEE Transactions on Information Theory
Approximate belief propagation, density evolution, and statistical neurodynamics for CDMA multiuser detection

IEEE Transactions on Information Theory

Multicode Sparse-Sequence CDMA: Approach to Optimum Performance by Linearly Complex WSLAS Detectors

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tse and Verdú proved that the global maximum likelihood (GML) detector achieves unit asymptotic multiuser efficiency (AME) in the limit of large random spreading CDMA. In this paper, we show that the wide-sense sequential likelihood ascent search (WSLAS) detectors achieve unit AME with channel load