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

Marat V. Burnashev, H. Vincent Poor

Research output: Contribution to journalArticle

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 languageEnglish (US)
Article number493
Number of pages1
JournalIEEE International Symposium on Information Theory-Proceedings
DOIs
StatePublished - Jan 1 2002

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A new upper bound on the probability of error in linear multiuser detection'. Together they form a unique fingerprint.

  • Cite this