Neural Networks for Multiuser Detection in Code-Division Multiple-Access Communications

IEEE Transactions on Communications

Volumn 40, Issue 7, 1992, Pages 1212-1222

  Aazhang, Behnaam ^a   Paris, Bernd Peter ^b   Orsak, Geoffrey C ^c  

^a RICE UNIVERSITY   (United States)

^b SIEMENS AG   (Germany)

^c GEORGE MASON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY - COMMUNICATION CHANNELS; MATHEMATICAL STATISTICS - MONTE CARLO METHODS; NEURAL NETWORKS; PATTERN RECOGNITION; RADIO TRANSMISSION - SPREAD SPECTRUM; SIGNAL PROCESSING - DIGITAL TECHNIQUES;

CDMA COMMUNICATIONS; GAUSSIAN CHANNELS; IMPORTANCE SAMPLING; MULTILAYER PERCEPTRONS; MULTIUSER DETECTION;

SIGNAL DETECTION;

EID: 0026886540     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.153366     Document Type: Article

References (28)

1. B. Aazhang and H. V. Poor, “Performance of DS/SSMA Communications in Impulsive Channels Part II: Hard limiting correlation receivers,” IEEE Trans. Commun., vol. 36, pp. 88–97. Jan. 1988.
2. B. Aazhang and H. V. Poor, “Performance of DS/SSMA communications in impulsive channels Part I: Linear correlation receivers,” IEEE Trans. Commun., vol. COM-35, pp. 1179–1188, Nov. 1987.
3. M. Brady, R. Raghavan, and J. Slawny, “Back propagation fails to separate where perceptrons succeed,” IEEE Trans. Circuits Syst., vol. 36, pp. 665–674, May 1989.
4. E. A. Geraniotis and M. B. Pursley, “Error probability for direct-sequence spread-spectrum multiple-access communications-Part II: Approximations,” IEEE Trans. Commun., vol. COM-30, pp. 985–995, May 1982.
5. A. B. Gschwendtner, DARPA Neural Network Study. AFCEA Int. Press, 1988.
6. K. Hornik, M. Stichcombe, and H. White, “Multilayer feedforward networks are universal approximators,” J. Neural Networks, vol. 2, pp. 359–366, 1989.
7. J. S. Lehnert and M.B. Pursley, “Error probabilities for binary direct-sequence spread-spectrum communications with random signature sequences,” IEEE Trans. Commun., vol. COM-35, pp. 87–98, Jan. 1987.
8. R. P. Lippmann, “An introduction to computing with neural nets,” IEEE ASSP Mag. vol. 4, pp. 4–22, Apr. 1987.
9. D. Lu and K. Yao, “Improved importance sampling technique for efficient simulation of digital communication systems,” IEEE Selec. Areas Commun., vol. 6, pp. 67–75, Jan. 1988.
10. R. Lupas and S. Verdu, “Near-far resistance of multiuser detectors in asynchronous channels,” IEEE Trans. Commun., vol. 38, pp. 496–508, Apr. 1990.
11. R. Lupas and S. Verdu, “Linear multiuser detectors for synchronous code-division multiple access channels,” IEEE Trans. Inform. Theory, vol. 34, pp. 123–136, Jan. 1989.
12. G. Orsak and B. Aazhang, “On the theory of importance sampling applied to the analysis of detection systems,” IEEE Trans. Commun., vol. 30, pp. 332–339, Apr. 1989.
13. G. Orsak and B. Aazhang, “Efficient importance sampling techniques for simulation of multiuser communication systems,” IEEE Trans. Commun.,, vol. 40, pp. 1111–1118, June 1992.
14. G. Orsak and B. Aazhang, “Constrained solutions in importance sampling via robust statistics,” IEEE Trans. Inform. Theory, vol. 37, pp. 307–316, Mar. 1991.
15. B.-P. Paris, G. Orsak, and B. Aazhang, “Neural networks in multiple-access communications,” Tech. Rep. TR-9020, Elect. Comput. Eng., Rice University, Houston, TX, 1990.
16. B.-P. Paris, G. Orsak, M.K. Varanasi, and B. Aazhang, “Neural net receivers in multiple-access communications,” in Advances in Neural Network Information Processing Systems. San Mateo, CA: Morgan Kaufmann, 1988.
17. H. V. Poor and S. Verdu, “Single-user detectors for multiuser channels,” IEEE Tras. Commun., vol 36, pp. 50–60, Jan. 1988.
18. M.B. Pursley, “Spread-spectrum multiple access communications,” in Multi User Communications, G. Longo, Ed., New York: Springer-Verlag, 1981, pp. 139–199.
19. M.B. Pursley and H. F. Roefs, “Numerical evaluation of correlation parameters for optimal phases of binary shift register sequences,” IEEE Trans. Commun., vol. COM-27, pp. 1597–1604, Oct. 1979.
20. M.B. Pursley, D.V. Sarwate, and W.E. Stark, “Error probability for direct-sequence spread-spectrum multiple-access communications-Part I: Upper and lower bounds,” IEEE Trans. Commun., vol. COM-30, pp. 975–984, May 1982.
21. D. E. Rumelhart, G. E. Hinton, and R.J. Williams, “Learning internal representation by error propagation,” in Parallel Distributed Processing: Explorations in the Microstructure of Cognition. Vol. I: Foundations, D. E. Rumelhart and J. L. McClelland, Eds., Cambridge, MA: MIT Press, 1986, pp. 318–362.
22. M. K. Varanasi and B. Aazhang, “Multistage detection for asynchronous code-division multiple-access communications,” IEEE Trans. Commun., vol. 38, pp. 509–519, Apr. 1990.
23. M. K. Varanasi and B. Aazhang, “Near-optimum detection in synchronous code-division multiple-access systems,” IEEE Trans. Commun., vol. 39, pp. 725–736, May 1991.
24. S. Verdu, “Computational complexity of optimum multiuser detection,” Algorithmica, vol. 4, no. 3, pp. 303–312, 1989.
25. S. Verdu, “Minimum probability of error for asynchronous Gaussian MA channels,” IEEE Trans. Info. Theory, vol. IT-32, pp. 85–96, Jan. 1986.
26. S. Verdu, “Optimum multiuser asymptotic efficiency,” IEEE Trans. Commun., vol. COM-34, pp. 890–897, Sept. 1986.
27. P. Werbos, Beyond Regression: New Tools for Prediction and Analysis in the Behavioral Sciences. Ph.D. dissertations, Harvard University, Cambridge, MA, 1974.
28. H. White, “Learning in artificial neural networks: A statistical perspective,” Neural Computation, vol. 1, pp. 425–464, 1989.