DocumentCode
2929421
Title
Computation of minimum complexity for near optimal synchronous CDMA multiuser detection
Author
Jones, Haley ; Wei, Lei
Author_Institution
Dept. of Eng., Australian Nat. Univ., Canberra, ACT, Australia
Volume
6
fYear
1998
fDate
1998
Firstpage
3554
Abstract
In this paper, we show how to compute the minimum complexity (in terms of the number of paths kept) for near optimal M-algorithm multiuser detection. Several proven properties of the vector Euclidean distance (VED) are utilised to give an efficient algorithm for computing the minimum VED leading to a value for the minimum required number of paths to be kept for a given number of users. The analytical results are supported by the simulation results
Keywords
code division multiple access; computational complexity; signal detection; synchronisation; minimum VED; minimum complexity; near optimal synchronous CDMA multiuser detection; vector Euclidean distance; Code division multiplexing; Design for disassembly; Detectors; Error correction; Error probability; Matched filters; Maximum likelihood detection; Multiuser detection; Performance loss; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 1998. GLOBECOM 1998. The Bridge to Global Integration. IEEE
Conference_Location
Sydney,NSW
Print_ISBN
0-7803-4984-9
Type
conf
DOI
10.1109/GLOCOM.1998.775871
Filename
775871
Link To Document