TY - JOUR

T1 - On the distance distribution of CDMA multiuser signal set

AU - Lu, Hsiao-Feng

AU - Vijay Kumar, P.

PY - 2001

Y1 - 2001

N2 - The asymptotic efficiency of each user in an asynchronous multiuser CDMA system is characterized by the user's associated minimum distance Dk,min. However, computing this quantity is in general, an NP-hard [1] problem. Determining the distance distribution of the signal set in such systems is similarly difficult. In this paper, we show that the distribution can be approximated by the Nakagami distribution when the channel undergoes quasi-static fading and when the product of the number of users and the number of bits of each user is large. We also provide an efficient algorithm which can compute Dk,min accurately for each user that makes use of a recently proposed multiuser detector [4].

AB - The asymptotic efficiency of each user in an asynchronous multiuser CDMA system is characterized by the user's associated minimum distance Dk,min. However, computing this quantity is in general, an NP-hard [1] problem. Determining the distance distribution of the signal set in such systems is similarly difficult. In this paper, we show that the distribution can be approximated by the Nakagami distribution when the channel undergoes quasi-static fading and when the product of the number of users and the number of bits of each user is large. We also provide an efficient algorithm which can compute Dk,min accurately for each user that makes use of a recently proposed multiuser detector [4].

UR - http://www.scopus.com/inward/record.url?scp=0034858535&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2001.936037

DO - 10.1109/ISIT.2001.936037

M3 - Conference article

AN - SCOPUS:0034858535

SN - 2157-8095

SP - 174

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - 2001 IEEE International Symposium on Information Theory (ISIT 2001)

Y2 - 24 June 2001 through 29 June 2001

ER -