Linear Multiuser Detectors for Synchronous Code-Division Multiple-Access Channels

IEEE Transactions on Information Theory

Volumn 35, Issue 1, 1989, Pages 123-136

  Lupas, Ruxandra ^a   Verdú, Sergio ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 51549086465     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.42183     Document Type: Article

References (19)

1. S. Verdu, “Minimum probability of error for asynchronous Gaussian multiple-access channels,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 85-96, Jan. 1986.
2. S. Verdu, “Optimum multi-user signal detection,” Ph.D. dissertation, Dept. Elec. Comput. Eng., Univ. of Illinois, Urbana-Champaign, Coordinated Sci. Lab., Urbana, IL, Rep. T-151, Aug. 1984.
3. S. Verdu, “Optimum multi-user asymptotic efficiency,” IEEE Trans. Commun., vol. COM-34, no. 9, pp. 890-897, Sept. 1986.
4. I. N. Bronshtein and K. A. Semendyayev, Handbook of Mathematics. Verlag Harri Deutsch, 1985.
5. J. Wozencraft and I. Jacobs, Principles of Communication Engineering. New York: Wiley, 1965.
6. K. S. Schneider, “ Optimum detection of code division multiplexed signals,” IEEE Trans. Aerosp. Electron. Syst., vol. AES-15, pp. 181-185, Jan. 1979.
7. T. Kailath, Linear Systems. Englewood Cliffs, NJ: Prentice-Hall, 1980.
8. R. Lupas-Golaszewski and S. Verdú, “Asymptotic efficiency of linear multiuser detectors,” in Proc. 25th IEEE Conf. Decision and Control, Athens, Greece, Dec. 1986, pp. 2094-2100.
9. D. Luenberger, Optimization by Vector Space Methods. New York: Wiley, 1969.
10. T. L. Boullion and P. L. Odell, Generalized Inverse Matrices. New York: Wiley-Interscience, 1971.
11. P. Lancaster and M. Tismenetsky, The Theory of Matrices. New York: Academic, 1985.
12. H. V. Poor, An Introduction to Signal Detection and Estimation. New York: Springer-Verlag, 1988.
13. C. W. Helstrom, Statistical Theory of Signal Detection, 2nd ed. London: Pergamon, 1968.
14. S. Verdú, “Optimum multi-user detection is NP-hard,” presented at the 1985 Int. Symp. Information Theory, Brighton, UK, June 1985.
15. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
16. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
17. G. D. Forney, “Maximum likelihood sequence estimation of digital sequences in the presence of intersymbol interference,” IEEE Trans. Inform. Theory, vol. IT-18, no. 3, pp. 363-378, May 1972.
18. S. Verdú, “Computational complexity of optimum multiuser detection,” Algorithmica, vol. 4, 1989, to appear.
19. R. Lupas and S. Verdú, “Near-far resistance of multiuser detectors in asynchronous channels,” IEEE Trans. Commun., vol. 37, 1989, to appear.