Strongest-users-only detectors for randomly spread CDMA

Shlomo Shamai, Benjamin M. Zaidel, Sergio Verdú

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations

Abstract

A randomly spread direct sequence code division multiple access (DS-CDMA) system operating in fiat fading is considered. Users are assumed to employ equal rates and transmit powers. The receiver ranks the users according to their received powers, and decodes only the subset that can be reliably decoded. Confining the discussion to asymptotic analysis (in terms of number of users and processing gain), we study the matched-filter detector, the linear minimum mean squared error (MMSE) detector, and the "optimum detector" under the above strongest-users decoding scheme. The total capacities under outage constraint, derived as functions of the fraction of users that cannot be reliably decoded (equivalent to the "outage probability"), are analyzed and compared.

Original languageEnglish (US)
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - Sep 12 2002
Event2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland
Duration: Jun 30 2002Jul 5 2002

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Strongest-users-only detectors for randomly spread CDMA'. Together they form a unique fingerprint.

Cite this