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

Author

Schlegel, Christian ; Wei, Lei

Author_Institution

Dept. of Electr. Eng., Utah Univ., Salt Lake City, UT, USA

Volume

45

Issue

5

fYear

1997

fDate

5/1/1997 12:00:00 AM

Firstpage

532

Lastpage

535

Abstract

A simple method to compute the minimum distance D_min in multiuser code division multiple access (CDMA) systems based on the Cholesky decomposition of the positive-definite symmetric correlation matrix is proposed. Although finding D_min 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

Keywords

code division multiple access; computational complexity; correlation methods; matrix algebra; random processes; signal detection; telecommunication channels; Cholesky decomposition; NP-hard problem; asymptotic efficiency; binary random signature waveforms; code division multiple access; minimum distance; multiuser CDMA systems; optimum multiuser detection; positive-definite symmetric correlation matrix; synchronous CDMA; Australia; Code division multiplexing; Detectors; Gaussian noise; Interference; Matched filters; Matrix decomposition; Multiaccess communication; Multiuser detection; Symmetric matrices;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.592552

Filename

592552