期刊文献+

一种新型可变半径的球形译码算法 被引量:2

Novel sphere decoding algorithm with improved radius search
下载PDF
导出
摘要 在MIMO系统的信号检测算法中,球形译码算法的性能最接近最大似然检测算法,但传统的球形译码算法复杂度较高。详细分析了球形译码算法原理的基础上对传统算法进行改进,提出了一种新型可变半径的球形译码算法。仿真结果表明,新算法可以在保持译码性能的同时有效地降低运算复杂度,从而更适合现代无线通信实时性的要求。 Among all of the signal detection algorithms in MIMO, the capability of the sphere decoding algorithm (SDA) is mostly close to the capability of the maximum-likehood decoding algorithm in respect of the bit error rate. But the calculation complexity of the conventional SDA is still large. To resolve this problem, in this paper we analyze the principle of the SDA and try to improve it. We develop a novel SDA with improved radius search. With the result of the simulation, it shows that the novel SDA not only can keep the same capability as the conventional SDA in the field of the bit error rate, but also effectively decrease the calculation complexity and satisfy the real-time requirement in the wireless communication better.
出处 《重庆邮电大学学报(自然科学版)》 2006年第z1期51-54,共4页 Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
关键词 MIMO 检测算法 球形译码算法 MIMO detection algorithm sphere decoding algorithm
  • 相关文献

参考文献7

  • 1[1]PAULRAJ A J,GORE D A,NABAR R U,et al.An overview of MIMO communications-a key to gigabit wireless[J].Proceedings of IEEE,2004,92(2):198-218.
  • 2[2]GOLDSMITH A,JAFAR S A,JINDAL N,et al.Capacity limits of MIMO channels[J].Selected Areas in Communications,2003,21,(5):684-702.
  • 3[3]LEE H J,PATIL S,RAJ R G.Wireless Networking and Communication Group (WNCG).Fundamental overview and simulation of MIMO systems for Space-time coding and Spatial Multiplexing[EB/OL].[2006-02-22].http://www.ece.utexas.edu/~ wireless/EE381 K11 _ Spring03/projects/4.1.pdf.
  • 4[4]HASSIBI B,VIKALO H.On the sphere-decoding algorithm Ⅰ.Expected complexity[J].IEEE Transactions,2005,53(8):2806 -2818.
  • 5[5]VIKALO H,HASSIBI B.On the sphere-decoding algorithm Ⅱ.Generalizations,secondorder statistics,and applications to communications[J].IEEE Transactions 2005,53(8):2819-2834.
  • 6[6]VITERBO E,BOUROS J.A universal lattice code decoder for fading channels[J].IEEE Transactions,1999,45 (5):1639 -1642.
  • 7[7]ZHAO Wanlun,GIANNAKIS G B.Sphere decoding algorithms with improved radius search[J].IEEE Transactions,2005,53(7):1104-1109.

同被引文献21

  • 1刘妹琴,程红梅.基于扩展“变球法”的颜色量化分析[J].工程设计学报,2006,13(3):175-178. 被引量:3
  • 2李颖,魏急波.裁减自动球形译码算法与性能分析[J].通信学报,2007,28(5):49-54. 被引量:5
  • 3Guo Zhan, Peter Nilsson. Reduced complexity Schnorr-Eu- chner decoding algorithms for MIMO systems [ J ]. IEEE Communications Letters ,2004,8 ( 5 ) :286-288.
  • 4Foschini G, Golden G, Valenzuela R, et al. Simplified pro- cessing for high spectral efficiency wireless communication employing multi-element arrays [ J ]. IEEE J. Select. Areas Commun.,2000,17 ( 11 ) : 1841-1852.
  • 5Damen M O, Gamal H E, Caire G. On maximum-likelihood detection and the search for the closest lattice point [ J ]. IEEE Trans. Inform. Theory ,2003,49 (10) :2389-2402.
  • 6Su K. Efficient Maximum Likelihood Detection for Commu- nication over MIMO Channels [ EB/OL ]. http ://www. cl. cam. ac. uk/Research/DTG/publications/public/ks349/ Su05 B. pdf, 2005-03-26.
  • 7Li Z,Xie X.A simple alamoufi space-time transmission scheme for asynchronous cooperative systems[J].Signal Processing Letters, 2007,14( 11 ) : 804-807.
  • 8Veronesi D G.D L CTH15-4:multiple frequency offset compen- sation in cooperative wireless systems[C]//Proceedings of Global Telecommunications Conference(GLOBECOM'06) ,2006:1-5.
  • 9Li Z, Qu D, Zhu G.An equalization technique for distributed STBC-OFDM system with multiple carder frequency offsets[C]// Proceedings of Wireless Communications and Networking Con- ference (WCNC 2006), April, 2006: 839-843.
  • 10Li Y,Zhang W,Xia X.Distributive high rate full diversity space- frequency codes for asynchronous cooperative communications[C]// Proceedings of the IEEE International Symposium on Informa- tion Theory, July, 2006: 2612-2616.

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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