On computing Verdú's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems

IEEE Transactions on Information Theory

Volumn 47, Issue 7, 2001, Pages 3049-3053

  Wing Kin, Ma ^a,b   Wong, Kon Max ^a,c   Ching, P C ^a,b  

^a IEEE

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c MCMASTER UNIVERSITY   (Canada)

Author keywords

Maximum likelihood (ML) detection; Multiuser detection; Performance analysis; Sequence detection

Indexed keywords

ALGORITHMS; BIT ERROR RATE; ERROR DETECTION; MAXIMUM LIKELIHOOD ESTIMATION; PULSE AMPLITUDE MODULATION; SIGNAL TO NOISE RATIO;

SEQUENCE DETECTION;

CODE DIVISION MULTIPLE ACCESS;

EID: 0035504043     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.959286     Document Type: Article

References (8)

1. Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference
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. Indecomposable error sequences in multiuser detection
5. Solving a class of optimum multiuser detection problems with polynomial complexity
6. Adaptive maximum-likelihood receiver for carrier-modulated data-transmission systems
7. A new bound on the error probability of maximum likelihood detection of signals subject to intersymbol interference