By Topic

A simple way to compute the minimum distance in multiuser CDMA systems

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
$33 $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)
C. Schlegel ; Dept. of Electr. Eng., Utah Univ., Salt Lake City, UT, USA ; L. Wei

A simple method to compute the minimum distance Dmin in multiuser code division multiple access (CDMA) systems based on the Cholesky decomposition of the positive-definite symmetric correlation matrix is proposed. Although finding Dmin is known to be NP-hard, this decomposition allows the computation of the minimum distance and the asymptotic efficiency of optimum multiuser detection to be performed very efficiently in almost all cases of practical interest. Numerical results for synchronous CDMA with binary random signature waveforms of length 31 are used to illustrate the method

Published in:

IEEE Transactions on Communications  (Volume:45 ,  Issue: 5 )