Fast Meta-heuristics for Multiuser Detection in DS-CDMA Systems
暂无分享,去创建一个
[1] Bart Naudts,et al. A comparison of predictive measures of problem difficulty in evolutionary algorithms , 2000, IEEE Trans. Evol. Comput..
[2] Sergio Verdu,et al. Multiuser Detection , 1998 .
[3] John G. Proakis,et al. Digital Communications , 1983 .
[4] Alex J. Grant,et al. Polynomial complexity optimal detection of certain multiple-access systems , 2000, IEEE Trans. Inf. Theory.
[5] Qiuping Zhu,et al. (1+/spl lambda/) evolution strategy method for asynchronous DS-CDMA multiuser detection , 2006, IEEE Communications Letters.
[6] E. Weinberger,et al. Correlated and uncorrelated fitness landscapes and how to tell the difference , 1990, Biological Cybernetics.
[7] Sergio Verdú,et al. Computational complexity of optimum multiuser detection , 1989, Algorithmica.
[8] Heng Siong Lim,et al. An efficient local search heuristics for asynchronous multiuser detection , 2003, IEEE Communications Letters.
[9] L. Rasmussen,et al. Multiuser detection in CDMA - a comparison of relaxations, exact, and heuristic search methods , 2004, IEEE Transactions on Wireless Communications.
[10] Sergio Verdú,et al. Minimum probability of error for asynchronous Gaussian multiple-access channels , 1986, IEEE Trans. Inf. Theory.
[11] Rick S. Blum,et al. A gradient guided search algorithm for multiuser detection , 2000, IEEE Communications Letters.