Indecomposable error sequences in multiuser detection

IEEE Transactions on Information Theory

Volumn 47, Issue 1, 2001, Pages 284-294

  Luo, Wei ^a,b   Ephremides, Anthony ^a,c  

^a IEEE   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

Code division multiple access (CDMA); Error probability; Error sequences; Multiuser detection

Indexed keywords

DECORRELATOR; INDECOMPOSABLE ERROR SEQUENCES; K-USER SYMMETRIC SYSTEM; MULTIUSER DETECTION;

BOUNDARY CONDITIONS; CODE DIVISION MULTIPLE ACCESS; CODING ERRORS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL METHODS; CORRELATION DETECTORS; ERROR DETECTION; GRAPH THEORY; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY; SPREAD SPECTRUM COMMUNICATION; WHITE NOISE;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0035096463     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.904527     Document Type: Article

References (7)

1. Multiuser detection
2. Minimum probability of error for asynchronous Gaussian multiple-access channels
3. Maximum likelihood sequence detection for intersymbol interference channels: A new upper bound on error probability
4. New bound on the error probability of maximum likelihood sequence detection of signals subject to intersymbol interference
5. Linear multiuser detectors for synchronous code-division-multiple-access channels
6. Optimal multiuser asymptotic efficiency