Strongest-users-only detectors for randomly spread {CDMA}

Shlomo Shamai; B. M. Zaidel; S. Verdu

Strongest-users-only detectors for randomly spread {CDMA}

Shlomo Shamai
, B. M. Zaidel
, S. Verdu

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

A randomly spread direct sequence code division multiple access (DS-CDMA) system operating in flat 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 language	American English
Title of host publication	Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
State	Published - 2002

Bibliographical note

Place of conference:Switzerland

Cite this

@inproceedings{3271c1ab772f4dd793f612c8a17162bf,

title = "Strongest-users-only detectors for randomly spread \{CDMA\}",

abstract = "A randomly spread direct sequence code division multiple access (DS-CDMA) system operating in flat 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.",

author = "Shlomo Shamai and Zaidel, \{B. M.\} and S. Verdu",

note = "Place of conference:Switzerland",

year = "2002",

language = "American English",

booktitle = "Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on",

}

TY - GEN

T1 - Strongest-users-only detectors for randomly spread {CDMA}

AU - Shamai, Shlomo

AU - Zaidel, B. M.

AU - Verdu, S.

N1 - Place of conference:Switzerland

PY - 2002

Y1 - 2002

N2 - A randomly spread direct sequence code division multiple access (DS-CDMA) system operating in flat 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.

AB - A randomly spread direct sequence code division multiple access (DS-CDMA) system operating in flat 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.

UR - https://scholar.google.co.il/scholar?q=Strongest-users-only+detectors+for+randomly+spread+%7BCDMA%7D&btnG=&hl=en&as_sdt=0%2C5

M3 - Conference contribution

BT - Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

ER -

Strongest-users-only detectors for randomly spread {CDMA}

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this