Branch-and-bound-based fast optimal algorithm for multiuser detection in synchronous CDMA
Authors:
- K. PattipatiKPK. Pattipati
- P. WillettPWP. Willett
- L. BrunelLBL. Brunel
- 30 March 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 3336-3340
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
This publication has 1 reference indexed in Scilit: