Loading [a11y]/accessibility-menu.js
Branch-and-bound-based fast optimal algorithm for multiuser detection in synchronous CDMA | IEEE Conference Publication | IEEE Xplore

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


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 multip...Show More

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.
Date of Conference: 11-15 May 2003
Date Added to IEEE Xplore: 11 June 2003
Print ISBN:0-7803-7802-4
Conference Location: Anchorage, AK, USA

References

References is not available for this document.