By Topic

Reduced-rank multiuser detectors based on vector and matrix conjugate gradient Wiener filters

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)
Hongya Ge ; Dept. of Electron. Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA ; Scharf, L.L. ; Lundberg, M.

Using the notion of expanding subspace and the framework of reduced-rank signal processing, we present our latest discovery on applying the vector and matrix conjugate gradient (CG) methods to design reduced-rank linear MMSE multiuser detectors (MUD) for code division multiple access (CDMA) systems. We show that for a synchronous CDMA system with K users, each using a distinct length N spreading code, the vector CG method converges to the full-rank linear MUD in at most K steps (K≤N).The matrix CG method converges to the full-rank linear MUD in one step. Furthermore, when the Gold codes are used as spreading codes in combination with a groupwise power control scheme, early convergence in the vector CG Wiener filter can be reached in just L steps (L≪K≤N), typically L=2∼4 independent of the user number K and the spreading length N.

Published in:

Signal Processing Advances in Wireless Communications, 2004 IEEE 5th Workshop on

Date of Conference:

11-14 July 2004