期刊文献+

一种基于可变禁忌长度的多用户检测方法 被引量:2

An Alterable Tabu Length Based Multi-user Detection Method
下载PDF
导出
摘要 CDMA系统的性能很大程度上受多用户干扰影响。多用户检测是抑制多用户干扰的有效方法。文中介绍一种基于可变禁忌长度的多用户检测方法。该方法以传统匹配滤波器的判决输出为初始解,采用禁忌长度可变的禁忌搜索(TS)算法,使禁忌长度与搜索空间的崎岖程度相适应,以避免搜索限入局部最优。仿真实验证明,该方法具有较好的误比特性能和抗远近效应能力,并具有多项式复杂度。 The performance of CDMA system is deeply influenced by multi-user interference. Multi-user detection(MUD) is proved to be an effective method to restrain such interference. In this study, we propose a Tabu Search(TS) algorithm for multi-user detection in CDMA system, where an alterable tabu length is used to ensure the tabu table is adaptive to the search landscape and to avoid local optimum. Simulation shows that this MUD method is good on BER, anti-near-far as well as computational complexity performance.
出处 《信号处理》 CSCD 北大核心 2005年第4期389-391,共3页 Journal of Signal Processing
基金 教育部科学技术重点项目(2000114)重庆市科委基金项目(2003-7881)
关键词 码分多址(CDMA) 多用户检测(MUD) 禁忌搜索(TS)算法 搜索空间 多用户检测方法 禁忌搜索 长度 可变 抗远近效应能力 CDMA系统 code-division multiple-access multi-user detection tabu search algorithm search landscape
  • 相关文献

参考文献8

  • 1贺一,刘光远,邱玉辉.Tabu Search中集中性和多样性的自适应搜索策略[J].计算机研究与发展,2004,41(1):162-166. 被引量:19
  • 2贺一,刘光远.禁忌搜索算法求解旅行商问题研究[J].西南师范大学学报(自然科学版),2002,27(3):341-345. 被引量:25
  • 3S. Verdu, Minimum probability of error for asynchronous Gaussian multi-access channels. IEEE Trans. Inform.Theory, 1986, Vol.32: p.85-p.96.
  • 4S. Verdu, Optimum multi-user asymptotic efficiency.IEEE Trans. Commun., 1986, Vol.34: p.890-p.897.
  • 5R. Lupas and S. Verdu, Linear multi-user detector for synchronous code-division multiple access channels,IEEE Trans. Inform. Theory, 1989, Vol.35: p.123-p.136.
  • 6M. J. Juntti, T. Schlosser, and J. O. Lilleberg, Genetic algorithms for multiuser detection in synchronous CDMA,Proc. Int. Symposium Inf. Theory '97, p.492.
  • 7E Glover and M. Laguna, Tabu search, Kluwer Academic Publishers, Boston MA, 1997.
  • 8R. Battiti, G. Tecchiolli, The reactive tabu search, ORSA Jour. on Computing, no. 2, p.126-p.140, 1994.

二级参考文献13

  • 1周培德.求解货郎担问题的几何算法[J].北京理工大学学报,1995,15(1):97-99. 被引量:11
  • 2杨忠 鲍明 等.人机结合求解中国旅行商问题[J].模式识别与人工智能,1995,18(4):372-376.
  • 3[1]F Glover, M Laguna. Tabu Search. Boston: Kluwer Academic Publishers, 1997
  • 4[2]Jacques A Ferland, I Soumia, L Alain .et al.. Scheduling using tabu search with intensification and diversification. Computer & Operations Research, 2001, 28(11): 1075~1092
  • 5[3]R Chelouah, P Siarry. Tabu search applied to global optimization. European Journal of Operation Research, 2000, 123(2): 256~270
  • 6[4]G Michel, L Gilbert, S Frédéric. A tabu search heuristic for the undirected selective traveling salesman problem. European Journal of Operation Research, 1998, 106(2-3): 539~545
  • 7[5]L Guangyun, H Yi, Q Yuhi .et al.. Research on influence of solving quality based on different initializing solution algorithm in tabu search. In: Proc of Int'l Conf on Communication, Circuits and Systems and West Sino Exposition. Chengdu: IEEE Press, 2002. 1141~1145
  • 8[10]Gerhard R. TSPLIB. 2001. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/
  • 9[11]I Kubn Altinel, Necati Aras, B John Oommen. Fast efficient and accurate solutions to the Hamiltonian path problem using neural approaches. Computers & Operations Research, 2000, 27(5): 461~494
  • 10罗映红.遗传算法求解组合优化问题研究[J].甘肃科学学报,1997,9(2):46-49. 被引量:12

共引文献41

同被引文献8

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部