Polynomial complexity optimal detection of certain multiple-access systems

IEEE Transactions on Information Theory

Volumn 46, Issue 6, 2000, Pages 2246-2248

  Schlegel, Christian ^a,b   Grant, Alex ^a,c  

^a IEEE   (United States)

^b University of Utah   (United States)

^c UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

Author keywords

Multiuser detection; Optimal detection; Polynomial complexity; Synchronous CDMA

Indexed keywords

ALGORITHMS; CODE DIVISION MULTIPLE ACCESS; COMPUTATIONAL COMPLEXITY; CORRELATION THEORY; POLYNOMIALS;

MULTIUSER DETECTION;

SIGNAL DETECTION;

EID: 0034270965     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.868499     Document Type: Article

References (5)

1. S. Verdü, Computational complexity of optimum multiuser detection," Algorithmica, pp. 303-312, May 1989.
2. S. Ulukus and R. Yates, Optimum multiuser detection is tractable for synchronous CDMA using M-sequences," IEEE Commun. Lett., vol. 2, pp. 89-91, Apr. 1998.
3. C. Sankaran and A. Ephremides, Solving a class of optimum multiuser detection problems with polynomial complexity," IEEE Trans. Inform. Theory, vol. 44, pp. 1958-1961, Sept. 1998.
4. R. Learned, A. Willsky, and D. Boroson, Low complexity optimal joint detection for oversaturated multiple access communications," IEEE Trans. Signal Processing, vol. 45, pp. 113-123, Jan. 1997.
5. M. Moher, An iterative multiuser decoder for near-capacity communications," IEEE Trans. Commun., vol. 46, pp. 870-880, July 1998.