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

A novel scheme for linear multiuser detection in asynchronous DS-CDMA systems with frequency selective fading

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

2 Author(s)
Uzmi, Z.A. ; Dept. of Electr. Eng., Stanford Univ., CA, USA ; Mujtaba, S.A.

A novel scheme for linear multiuser detection (MUD) based on sub-symbol diversity is presented that is applicable to asynchronous CDMA systems with frequency selective fading. Traditional solutions for asynchronous linear MUD result in a prohibitively large decorrelation matrix. The new scheme transforms the asynchronous problem into a synchronous one by creating sub-symbols that are, by design, time-aligned with all other users and their respective multipath signals. The resulting decorrelation matrix is dramatically reduced in size, thus offering a viable solution for implementation. We also present an optimal scheme for combining the sub-symbols that is based on the condition number of the decorrelation matrices

Published in:

Global Telecommunications Conference, 1999. GLOBECOM '99  (Volume:1B )

Date of Conference:

1999

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.