Title :
Indecomposable error sequences in multiuser detection
Author :
Luo, Wei ; Ephremides, Anthony
Author_Institution :
Lucent Technol. Bell Labs., Holmdel, NJ, USA
fDate :
1/1/2001 12:00:00 AM
Abstract :
In this paper, we provide a graph-based characterization of the set of indecomposable sequences that are useful in the computation of an upper bound to error probability of maximum-likelihood (ML) detection in code-division multiple-access (CDMA) multiuser systems. We apply this characterization to a K-user symmetric system and to a two-user two-rate system. It leads to a precise calculation of the bound which is then compared to the performance of a decorrelator
Keywords :
code division multiple access; error statistics; graph theory; maximum likelihood detection; multiuser channels; sequences; CDMA multiuser systems; K-user symmetric system; code-division multiple-access multiuser systems; error probability; graph-based characterization; indecomposable error sequences; maximum-likelihood detection; multiuser detection; performance; two-user two-rate system; Decorrelation; Detectors; Error probability; Intersymbol interference; Laboratories; Maximum likelihood detection; Multiaccess communication; Multiple access interference; Multiuser detection; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
