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

Optimum multiuser detection is tractable for synchronous CDMA systems using m-sequences

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)
Ulukus, Sennur ; Dept. of Electr. & Comput. Eng., Rutgers Univ., Piscataway, NJ, USA ; Yates, R.D.

The optimum multiuser detection problem was shown to be NP-hard, i.e., its computational complexity increases exponentially with the number of users (Verdu 1986, 1989). In this letter, we show that the optimum multiuser detection problem for a synchronous code-division multiple access (CDMA) system is equivalent to the minimum capacity cut problem in a related network and propose an optimum multiuser detection algorithm with polynomial computational complexity for a certain class of signature sequences. The minimum cut problem is solvable in polynomial time if the capacities of the links not incident to source and sink are nonnegative. This condition in the optimum detection problem is equivalent to all cross correlations between the signature sequences of the users being negative. One example of such a set of signature sequences is obtained when shifted versions of the maximal length sequences (or m-sequences) are used. In this case the cross correlation between users i and j is given as /spl Gamma//sub ij/=-1/G for all i,j, where G is the processing gain.

Published in:

Communications Letters, IEEE  (Volume:2 ,  Issue: 4 )

Date of Publication:

April 1998

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.