Referenced Items are not available for this document.
In code-division multiple access (CDMA) systems, the optimal multiuser detection is equivalent to an unconstrained quadratic bivalent optimization problem, and its computational complexity increases exponentially with the number of users. In this paper, we propose several new suboptimal detectors with a greatly reduced computational complexity based on a local minimization algorithm for a synchronous CDMA system. The performances of these detectors are compared with those of the conventional, optimal, and several other suboptimal detectors
Published in:
Communications, IEEE Transactions on
(Volume:44
,
Issue:
7
)
Date of Publication: Jul 1996
- Page(s):
- 782 - 785
- ISSN :
- 0090-6778
- INSPEC Accession Number:
- 5344248
- Digital Object Identifier :
- 10.1109/26.508296
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Jul 1996
- Sponsored by :
- IEEE Communications Society
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
