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

Abstract

Tse and Verdu 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 < 1/2 - 1/(4 ln 2) bits/s/Hz. In simulations for random multicode equal-power systems, the WSLAS with a linear per-bit complexity approaches the GML BER in all SNR with channel load as high as 1.05 bits/s/Hz.