A comparative study on reduced complexity maximum likelihood based CDMA multiuser detectors

Author

Al-Susa, E.A. ; Cruickshank, D.G.M.

Author_Institution

Dept. of Electron. & Electr. Eng., Edinburgh Univ., UK

Volume

3

fYear

2001

fDate

6/23/1905 12:00:00 AM

Firstpage

1889

Abstract

The aim of this paper is to present a comparison between four tree-search based multiuser detectors, namely, the pre-selection based maximum likelihood detector (PS-ML) (Al-Susa and Cruickshank, 2001), the M-algorithm detector (MA) (Wei et al., 1997), the greedy algorithm detector (GA) (AlRustamani and Vojcic, 2000), and the optimum maximum likelihood (ML) detector (Verdu, 1986). The comparison is on the basis of BER performance and computational complexity in both AWGN and multipath channels

Keywords

AWGN channels; code division multiple access; computational complexity; data communication; error statistics; maximum likelihood detection; mobile radio; multipath channels; multiuser channels; tree searching; AWGN channels; BER performance; CDMA; M-algorithm detector; computational complexity; data rates; greedy algorithm detector; mobile radio; multipath channels; multiuser detectors; optimum maximum likelihood detector; pre-selection based maximum likelihood detector; tree search; AWGN; Bit error rate; Detectors; Greedy algorithms; Maximum likelihood detection; Multiaccess communication; Multiple access interference; Nonlinear filters; Signal processing; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference, 2001. VTC 2001 Fall. IEEE VTS 54th

Conference_Location

Atlantic City, NJ

ISSN

1090-3038

Print_ISBN

0-7803-7005-8

Type

conf

DOI

10.1109/VTC.2001.956529

Filename

956529