Computational complexity of optimum multiuser detection
暂无分享,去创建一个
[1] D. Campana,et al. Spread-spectrum communications , 1993, IEEE Potentials.
[2] Sergio Verdú,et al. Linear multiuser detectors for synchronous code-division multiple-access channels , 1989, IEEE Trans. Inf. Theory.
[3] V.W.S. Chan,et al. Principles of Digital Communication and Coding , 1979 .
[4] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[5] Sergio Verdú,et al. Multiple-access channels with point-process observations: Optimum demodulation , 1986, IEEE Trans. Inf. Theory.
[6] Sergio Verdu,et al. Optimum Multi-User Signal Detection , 1984 .
[7] K. Schneider. Optimum Detection of Code Division Multiplexed Signals , 1979, IEEE Transactions on Aerospace and Electronic Systems.
[8] A. P. Clark,et al. Advanced data-transmission systems , 1977 .
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Gerard J. Foschini,et al. A reduced state variant of maximum likelihood sequence detection attaining optimum performance for high signal-to-noise ratios , 1977, IEEE Trans. Inf. Theory.
[11] Laurence B. Milstein,et al. Spread-Spectrum Communications , 1983 .
[12] Demetrios Kazakos. Computational savings and implementation of maximum likelihood detectors (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[13] Sergio Verdú,et al. Optimum Multiuser Asymptotic Efficiency , 1986, IEEE Trans. Commun..
[14] Sergio Verdú,et al. Minimum probability of error for asynchronous Gaussian multiple-access channels , 1986, IEEE Trans. Inf. Theory.