Fast optimal and suboptimal any-time algorithms for CDMA multiuser detection based on branch and bound

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 channel with Gaussian noise. Relationships between the proposed algorithms (depth-first BBD and fast BBD) and both the d...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on communications 2004-04, Vol.52 (4), p.632-642
Hauptverfasser:	Jie Luo, Pattipati, K.R., Willett, P., Levchuk, G.M.
Format:	Artikel
Sprache:	eng
Schlagworte:	Computational complexity Computational efficiency Decoding Decorrelation Detectors Gaussian noise Multiaccess communication Multiuser detection Object detection Upper bound
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!