On the probability of error in linear multiuser detection

The problem of determining the bit-error probability in linear multiuser detection analytically is considered. A number of upper and lower bounds are developed, some of which are very tight, and issues of asymptotic behavior, optimality, and Gaussian approximation are explored. Several special cases...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2003-08, Vol.49 (8), p.1922-1941
Hauptverfasser:	Burnashev, M.V., Poor, H.V.
Format:	Artikel
Sprache:	eng
Schlagworte:	Approximation Asymptotic properties Detectors Equations Error detection Error probability Errors Gaussian Gaussian approximation Gaussian noise Information systems Information theory Lower bounds Mathematical analysis Maximum likelihood detection Multiuser detection Optimization Random variables Signal design Signal processing Theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	The problem of determining the bit-error probability in linear multiuser detection analytically is considered. A number of upper and lower bounds are developed, some of which are very tight, and issues of asymptotic behavior, optimality, and Gaussian approximation are explored. Several special cases, including those of equi-energy and equi-correlated signals, are treated in some detail.
ISSN:	0018-9448 1557-9654
DOI:	10.1109/TIT.2003.814475