Branch-and-bound-based fast optimal algorithm for multiuser detection in synchronous CDMA

Author

Luo, J. ; Pattipati, K. ; Willett, P. ; Brunel, L.

Author_Institution

Inst. for Syst. Res., Maryland Univ., College Park, MD, USA

Volume

5

fYear

2003

fDate

11-15 May 2003

Firstpage

3336

Abstract

A fast optimal algorithm based on the branch and bound (BBD) method is proposed for the joint detection of binary symbols of K users in a synchronous code-division multiple access (CDMA) channel with Gaussian noise. Relationships between the proposed algorithms (depth-first BBD and fast BBD) and both the decorrelating decision feedback (DF) detector and sphere decoding (SD) algorithm are clearly drawn. It turns out that decorrelating DF detector corresponds to a "one-pass" depth-first BBD; sphere decoding is in fact a type of depth-first BBD, but one that can be improved considerably via tight upper bounds and user ordering as in our fast BBD.

Keywords

Gaussian noise; automatic repeat request; code division multiple access; maximum likelihood detection; multiuser detection; optimisation; tree searching; Gaussian noise; binary symbols; branch and bound method; code-division multiple access channel; decision feedback detector; joint detection; optimal algorithm; sphere decoding algorithm; Code division multiplexing; Computational efficiency; Covariance matrix; Decorrelation; Detectors; Gaussian noise; Maximum likelihood decoding; Multiaccess communication; Multiuser detection; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2003. ICC '03. IEEE International Conference on

Print_ISBN

0-7803-7802-4

Type

conf

DOI

10.1109/ICC.2003.1204072

Filename

1204072