By Topic

Reduced complexity ML multiuser sequence detection with per-survivor interference cancellation

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
$33 $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

2 Author(s)
E. S. Esteves ; Commun. Sci. Inst., Univ. of Southern California, Los Angeles, CA, USA ; R. A. Scholtz

In order to reduce the complexity of the optimum ML multiuser sequence detector, which grows exponentially with the number of users, we propose suboptimum MLSE algorithms to detect DS/CDMA signals where the likelihood computations are based on reduced-state trellises. Thus, the number of complex arithmetic computations per detected symbol can be significantly reduced. We propose the use of single or multiple trellises. In both cases, tentative decisions based on the surviving paths are used to approximate the desired likelihood function. Simulation results show that the algorithm proposed can achieve significant complexity reduction with marginal performance degradation.

Published in:

Signals, Systems & Computers, 1997. Conference Record of the Thirty-First Asilomar Conference on  (Volume:2 )

Date of Conference:

2-5 Nov. 1997