By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yi Sun ; City Coll., Dept. of Electr. Eng., City Univ. of New York, New York, NY, USA

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.

Published in:

Communications, IEEE Transactions on  (Volume:57 ,  Issue: 8 )