A new upper bound on the probability of error in linear multiuser detection

Marat V. Burnashev; H. Vincent Poor

doi:10.1109/ISIT.2002.1023765

A new upper bound on the probability of error in linear multiuser detection

Research output: Contribution to journal › Article › peer-review

Abstract

The bit-error probability in linear multiuser detection was considered and an upper bound for it was proposed. This bound was found to be practically as efficient as the Gaussian approximation for modest values of signal to noise ratio. It had good accuracy for high signal to noise ratio, where the Gaussian approximation failed.

Original language	English (US)
Article number	493
Pages (from-to)	493
Number of pages	1
Journal	IEEE International Symposium on Information Theory-Proceedings
DOIs	https://doi.org/10.1109/ISIT.2002.1023765
State	Published - 2002

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2002.1023765

Cite this

@article{affc49e21d7945fca65bf0dd29a53640,

title = "A new upper bound on the probability of error in linear multiuser detection",

abstract = "The bit-error probability in linear multiuser detection was considered and an upper bound for it was proposed. This bound was found to be practically as efficient as the Gaussian approximation for modest values of signal to noise ratio. It had good accuracy for high signal to noise ratio, where the Gaussian approximation failed.",

author = "Burnashev, {Marat V.} and Poor, {H. Vincent}",

year = "2002",

doi = "10.1109/ISIT.2002.1023765",

language = "English (US)",

pages = "493",

journal = "IEEE International Symposium on Information Theory-Proceedings",

issn = "2157-8095",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - A new upper bound on the probability of error in linear multiuser detection

AU - Burnashev, Marat V.

AU - Poor, H. Vincent

PY - 2002

Y1 - 2002

N2 - The bit-error probability in linear multiuser detection was considered and an upper bound for it was proposed. This bound was found to be practically as efficient as the Gaussian approximation for modest values of signal to noise ratio. It had good accuracy for high signal to noise ratio, where the Gaussian approximation failed.

AB - The bit-error probability in linear multiuser detection was considered and an upper bound for it was proposed. This bound was found to be practically as efficient as the Gaussian approximation for modest values of signal to noise ratio. It had good accuracy for high signal to noise ratio, where the Gaussian approximation failed.

UR - http://www.scopus.com/inward/record.url?scp=0036353808&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036353808&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2002.1023765

DO - 10.1109/ISIT.2002.1023765

M3 - Article

AN - SCOPUS:0036353808

SN - 2157-8095

SP - 493

JO - IEEE International Symposium on Information Theory-Proceedings

JF - IEEE International Symposium on Information Theory-Proceedings

M1 - 493

ER -

A new upper bound on the probability of error in linear multiuser detection

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this