By Topic

Near-optimum iterative multiuser detection in time-frequency-domain spread multicarrier DS-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
$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

3 Author(s)
Peng Pan ; Sch. of ECS, Univ. of Southampton, Southampton, UK ; Lie-Liang Yang ; Youguang Zhang

In this contribution we propose and study a novel iterative time-frequency-domain (TF-domain) multiuser detector (MUD) for the multicarrier direct-sequence code-division multiple-access system employing both T-domain and F-domain spreading, which, for brevity, is referred to as the TF/MC DSCDMA system. The proposed iterative TF-domain MUD consists of a set of T-domain soft-input soft-output MUDs (SISO-MUDs) and a set of F-domain SISO-MUDs, which exchange information through two multiuser interference (MUI) cancellation units. Both the T-domain and F-domain SISO-MUDs are operated under the maximum a-posteriori (MAP) principles. In this contribution the complexity and bit error rate (BER) performance of the TF/MC DS-CDMA employing the proposed iterative TF-domain MUD are investigated and also compared with the other existing MUD schemes, including the optimum MUD and the joint/separate minimum mean-square error (MMSE) MUDs. Our study shows that the iterative TF-domain MUD is capable of achieving nearly the same BER performance as the optimum MUD, but at much lower complexity.

Published in:

Communications and Networking in China (CHINACOM), 2010 5th International ICST Conference on

Date of Conference:

25-27 Aug. 2010