Optimum multiuser detection is tractable for synchronons CDMA systems usine M-sequences

IEEE Communications Letters

Volumn 2, Issue 4, 1998, Pages 89-91

  Ulukus, Sennur ^a   Yates, Roy D ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

CDMA; Optimum multiuser detection

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CORRELATION THEORY; MATRIX ALGEBRA; PHASE SHIFT KEYING; POLYNOMIALS; PROBABILITY DENSITY FUNCTION; PROBLEM SOLVING; SIGNAL RECEIVERS; SPURIOUS SIGNAL NOISE;

CODE DIVISION MULTIPLE ACCESS; MINIMUM CAPACITY CUT PROBLEM; OPTIMUM MULTIUSER DETECTION PROBLEM;

MULTIPLEXING;

EID: 3342886083     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/4234.664214     Document Type: Article

References (7)

1. S. Verdú, "Minimum probability of error for asynchronous Gaussian multiple-access channels," IEEE Trans. Inform. Theory, vol. 32, pp. 85-96, Jan. 1986.
2. _, "Computation complexity of optimum multiuser detection" Algorithmica, vol. 4, pp. 303-312, 1989.
3. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, 1993.
4. P. L. Hammer (Ivanescu), "Some network flow problems solved with pseudo-Boolean programming," Oper. Res., vol. 13, pp. 388-399, 1965.
5. J. C. Picard and H. D. Ratliff, "Minimum cuts and related problems," Networks, vol. 5, pp. 357-370, 1974.
6. K. W. Yip and T. S. Ng, "Code phase assignment - A technique for high capacity indoor mobile DS-CDMA communications," in IEEE Vehicular Technology Conf. VTC'94, 1994, pp. 1586-1590.
7. M. K. Varanasi, "Asymptotically optimum multiuser decision feedback detection," in IEEE Int. Symp. on Information Theory, 1997, p. 275.