期刊文献+

多用户检测中一种改进选择法的模拟退火遗传算法研究

下载PDF
导出
摘要 将模拟退火遗传算法应用到多用户检测技术中,可以降低了检测算法的复杂度并有效解决移动通信系统中存在的多址干扰等问题。当网络相对空闲时,模拟退火遗传算法检测器筛选用户信息的精确度会下降。对此,提出了将一种改进的模拟退火遗传算法应用到多用户检测技术中,即基于期望值选择法的模拟退火遗传算法。从理论分析可以看出基于期望值选择法的模拟退火遗传算法比传统的模拟退火遗传算法的精确度更高,仿真结果也表明基于前者的检测器性能明显优于后者。
作者 王琳
出处 《广东通信技术》 2011年第6期71-73,共3页 Guangdong Communication Technology
  • 相关文献

参考文献7

  • 1王少尉,季晓勇.最优多用户检测问题研究[J].电子学报,2007,35(12):2339-2342. 被引量:4
  • 2S.Verdu. Minimum Probability of Error for Asynchronous Gaussian Multiple Access Channels [J]. IEEE Trans on Info, 1986, 32(1):85-96.
  • 3周丽,孙树栋.遗传算法原理及应用[M].北京:国防工业出版社,2001.
  • 4Ergun C,Haciogiu K.Multi-user detection using a genetic algorithm in CDMA communications syste- ms [J]. IEEE Trans Commun.2000, 48(8):1374-1383.
  • 5G.L.Chen, X.F.Wang, Z.Q.Zhuang. GeneticAIgorithm and Its Application[M]. Beijing: Posts & Telecom Press, 1996.
  • 6Abedi S,TafazolliR. Genetically modified multiuser detection for code division multiple accesssystems[J]. IEEEJSAC,2002,20(2):463-473P.
  • 7Han K H, J H. Genetic quantum algorithm and its application to combinational optim- ization problem[J]. Proceedings of the 2000 Congress on Evolutionary Computation IEEEpress,2001:1354-1360P.

二级参考文献10

  • 1S Verdu.Minimum probability of error for asynchronous gaussian multiple-access channels[ J ]. IEEE Transactions on Information Theory, 1986,32(1) :85 - 95.
  • 2D Fogel. Evolutionary Computation: The Fossil Record. Piscataway[ M ]. NJ: IEEE Press, 1998.
  • 3H Holger, S Thomas. Stochastic Local Search: Foundations and Applications[ M ]. San Fransisco: Morgan Kaufmann Publishers/Elsevier, 2004.
  • 4H Lim, M Rao, et al. Multiuser detection for DS-CDMA systerns using evolutionary programming [ J]. IEEE Communications Letters,2003,7(3) : 101 - 103.
  • 5S Wang,Q Zhu,L Kang. ( 1 + λ ) evolution strategy method for asynchronous DS-CDMA mulfiuser detection [ J ]. IEEE Communications Letters,2006,10(6) :423 - 425.
  • 6H Lim, B Venkatesh. An efficient local search heuristics for asynchronous multiuser detection [ J ]. IEEE Communications Letters,2003,7(6) :299 - 301.
  • 7S Verdu. Computational complexity of optimal multiuser detection[ J]. Algorithmica, 1989,4(3) : 303 - 312.
  • 8H Beyer, H P Schwefel. Evolution strategies: A comprehensive introduction[ J] .Natural Computing, 2002,1 ( 1 ) :3 - 52.
  • 9M Varanasi, Aazhang. Multi-stage detection in asynchronous code-division multiple access communications[ J]. IEEE Transactions on Communications, 1990, 38(8) :509 - 519.
  • 10P Merz, B Freisleben. Greedy and local search heuristics for unconstrained binary quadratic programming [ J ]. Journal of Heuristics, 2002,8(2) : 197 - 213.

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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