By Topic

Polynomial expansion based fast iterative multiuser detection algorithm for synchronous 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

5 Author(s)
Jinfan Zhang ; Dept. of Electron. Eng., Tsinghua Univ., Beijing, China ; Yongle Wu ; Jing Gu ; Shidong Zhou
more authors

Multiuser detection algorithms usually have very high computational complexity, which greatly limits their usage. Polynomial expansion (PE) multiuser detector can be viewed as an iterative approach to approximate the linear multiuser detectors with low complexity (O(N2)). In this paper, we propose a new PE detector, which exhibits both faster convergence (fewer iterations) and higher performance (comparable to the MMSE multiuser detector). Analysis and simulation results for the third generation mobile communication system TD-SCDMA have shown the viability of this new detector. Even under high mobility circumstance, the proposed PE detector can still sustain its good performance.

Published in:

Vehicular Technology Conference, 2005. VTC 2005-Spring. 2005 IEEE 61st  (Volume:2 )

Date of Conference:

30 May-1 June 2005