期刊文献+

基于免疫算法的球形译码算法研究 被引量:3

Sphere decoding algorithm based on an immune algorithm
下载PDF
导出
摘要 在多输入多输出(MIMO)系统的信号检测算法中,球形译码算法的性能最接近最大似然检测算法,是目前应用最为广泛的一种信号检测方法,但传统的球形译码算法在低信噪比时计算复杂度较高,在高信噪比时误码率性能不够理想.该文提出了一种改进的球形译码方法,利用免疫算法的寻优能力来获得最佳的初始搜索半径,从而达到在保证译码性能的同时有效地降低计算复杂度的目的.实验仿真结果表明,与传统的球形译码算法相比,基于免疫算法的球形译码方法在高信噪比下可以达到最大似然译码的性能,同时能有效降低低信噪比时的运算复杂度,从而更符合现代无线通信实时性的要求. Among all multiple-input multiple-output (MIMO) signal detection algorithms, the performance of the sphere decoding (SD) algorithm is closest to the performance of the maximum likelihood (ML) decoding algorithm. At present, the SD algorithm is the most widely used as a signal detection method. Unfortunately the calcu- lation complexity of the conventional SD algorithm is still high at low signal-to-noise ratios (SNRs) and its performance is not ideal at high SNRs. This paper presents a novel SD method where the initial search radius can be obtained using an immune algorithm. Based on results of experiments and simulations, it was concluded that compared with the conventional SD algorithm, the new sphere decoding method not only has the same bit error rate performance as the ML decoding algorithm at high SNRs, but also effectively reduces the calculation complexity at low SNRs. It should satisfy real-time requirement in wireless communication.
出处 《哈尔滨工程大学学报》 EI CAS CSCD 北大核心 2009年第11期1301-1305,共5页 Journal of Harbin Engineering University
基金 国家自然科学基金资助项目(50435040)
关键词 多输入多输出 球形译码算法 免疫算法 最大似然译码算法 muhiple-input muhiple-output sphere decoding algorithm immune algorithm maximum likelihood decoding algorithm
  • 相关文献

参考文献8

  • 1POHST M. On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications[J]. ACM SIGSAM, 1981,15( 1 ) :37-44.
  • 2VITERBO E, BIGLIER E. A universal decoding algorithm for lattice codes [ C ]//Proc Quatorzieme Colloque GRETSI, Guan Les, France, 1993.
  • 3DAMEN M O , CHKEIF A , BELFIORE J C. Lattice code decoder for space-time codes [ J ]. IEEE Communications Letters, 2000,4(5) : 161-163.
  • 4FINCKE U, PHOST M. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis [J]. Mathematics of Computation, 1985, 44 (4):463-471.
  • 5LIU Qianlei, YANG Luxi. A novel method for initial radius selection of sphere decoding[ C]//IEEE Semiannual Vehicular Technology Conference VTC-Fall. [ s. l. ] , 2004.
  • 6HASSIBI B , VIKALO H. On the sphere- decoding algorithm I. expected complexity [ J]. IEEE Transactions on Signal Processing, 2005, 53 (8) :2806 -2818.
  • 7王磊,潘进,焦李成.免疫算法[J].电子学报,2000,28(7):74-78. 被引量:349
  • 8VITERBO E , BOUTROS J. A universal lattice code decoder for fading channels [ J ]. IEEE Transactions on Information Theory, 1999, 45(7) :1639-1642.

二级参考文献1

共引文献348

同被引文献11

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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