By Topic

Reduced complexity iterative multiuser detection/decoding for turbo coded CDMA systems

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

3 Author(s)
A. A. Airstamani ; Dept. of Electr. Eng. & Comput. Sci., George Washington Univ., Washington, DC, USA ; A. D. Damnjanovic ; B. R. Vojcic

Recently, a novel scheme for iterative multiuser detection and turbo decoding was proposed by the authors (2000). It has been shown that the proposed detector approaches the multiuser capacity limit within 1 dB in the low signal-to-noise ratio region. However, the main drawback of the scheme is its exponential complexity in the number of users, which is due to the complexity of the MAP multiuser detector. In this paper, we show that the complexity of the algorithm can be significantly reduced by employing a greedy multiuser detector. The results for both the additive white Gaussian noise and the single-path fading channels show that the substantial reduction in complexity introduces a slight degradation in performance, 0.5 dB compared to MAP detector

Published in:

Communications, 2001. ICC 2001. IEEE International Conference on  (Volume:9 )

Date of Conference: