Cart (Loading....) | Create Account
Close category search window
 

An efficient blind multiuser detector for 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

4 Author(s)
Zhengyu Li ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore ; Getian Ye ; Guoan Bi ; Chunhua Yang

An efficient blind adaptive multiuser detector based on the modified RLS algorithm is proposed for synchronous DS-CDMA systems over a flat fading channel with large spreading sequences. We first properly decompose the optimal weight vector associated with the original code of the desired user into several adaptive weight subvectors. A modified adaptive algorithm based on the conventional RLS algorithm is derived to update the weight subvectors. Simulation results show that the proposed detector achieves better performance than the adaptive detector using conventional RLS algorithm especially for DS-CDMA systems with large processing gains. In addition, it is computationally efficient and robust against the near-far problem

Published in:

Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE  (Volume:1 )

Date of Conference:

2000

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.