期刊文献+

一种基于球形译码的分层空时译码算法 被引量:1

SD based decoding algorithm for layered space-time codes
下载PDF
导出
摘要 为了进一步降低分层空时接收机的球形译码复杂度,提出了一种分组球形译码算法。接收对信号矢量的分量进行分组,每个分组内部采用球形译码算法进行检测,而各个分组之间通过判决反馈的方式进行干扰抵消。由于在各个分组内部进行球形译码,大大降低了最坏情况下的计算量,从而简化了接收机复杂度。计算机仿真结果表明,新算法能够明显的降低接收机译码过程的计算量。 In order to further reduce the computation complexity of sphere decoding (SD) based layered space-time codes receiver, a new receiver algorithm with grouping sphere decoding structure is presented. The elements of signal vector are divided into several groups. The receiver performs sphere decoding for the elements within the same group. The already detected groups are cancelled by using decision feed equalization. Since the sphere decoding are performed in each group separately the worst case complexity of sphere decoding is reduced dramatically. Simulation results show that the decoding complexity of the new algorithm is much lower compared with that of the original sphere decoding algorithm while still maintaining reasonable performance.
出处 《电路与系统学报》 CSCD 北大核心 2008年第5期22-25,共4页 Journal of Circuits and Systems
基金 国家自然科学基金资助项目(60702060) 西安电子科技大学研究生创新基金资助项目(050710)
关键词 球形译码 分层空时码 复杂度 sphere decoding (SD) layered space-time codes complexity
  • 相关文献

参考文献7

  • 1Emre T. Capacity of multi-antenna gaussian channels [J]. European Transactions on Telecommunications, 1999, 10(6): 585-595.
  • 2Foschini G J, Golden G D, Valenzuela R A, Wolniasky P W. Simplified processing for high spectral efficiency wireless communication employing multi-antenna arrays [J]. IEEE Journal on Selected Areas in Communications, 17(11): 1841-1852.
  • 3Gesbert D, Shaft M, Shiu Da-Shan, Smith P, Naguib A. From theory to practice: an overview of MIMO space-time coded wireless systems [J]. IEEE Journal on Selected Areas in Communications, 2003, 21(3): 281-302.
  • 4Viterbo E, Boutros J. A universal lattice decoder for fading channels [J]. IEEE Transaction on Information Theory, 1999, 45(5): 1639-1642.
  • 5Damen O, Ammar C, Belfiore J-C. Lattice code decoder for space-time codes [J]. IEEE Communications Letters, 2000, 4(5): 161-163.
  • 6Vikalo H, Hassibi B. On sphere decoding algorithm I: expected complexity [J]. IEEE Transaction on Signal Processing, 2005, 53(8): 2806-2818.
  • 7Zimmermann E, Rave W, Fettweis G. On the complexity of sphere decoding [OL]. http://www.ifn.et.tu-dresden.de/MNS/veroeffentlichungen/2004/ZimmermannE_WPMC 04a.pdf, 2004.

同被引文献14

  • 1VITERBO E,BOUTROS J.A universal lattice code decode for fading channel[J].IEEE Transactions on Information Theory,1999,45(5):1639-1642.
  • 2DAMEN O,CHKEIF A,BELFIORE J-C.Lattice code decoder for space-time codes[J].IEEE Communication Letters,2000,4(5):161-163.
  • 3HASSIBI B,VIKALO H.On the sphere-decoding algorithm[J].IEEE Transactions on Signal Processing,2005,53 (8):2806-2818.
  • 4VIKALO H,HASSIBI B.On the sphere-decoding algorithm Ⅱ.generalization,second-order statistics and applications to communications[J].IEEE Transactions on Signal Processing,2005,53(8):2819-2834.
  • 5CHOI J W,SHIM B H,SINGER A C,et al.Low-complexity decoding via reduced dimension maximum-likelihood search[J].IEEE Transactions on Signal Processing,2010,58(3):1780-1793.
  • 6BARBERO L G,THOMPSON J S.A fixed-complexity MIMO detector based on the complex sphere decoder[C] // SPAWC '06:Proceedings of IEEE 7th Workshop on Signal Processing Advances in Wireless Communications.Piscataway,NJ:IEEE Press,2006:1-5.
  • 7DAMEN M O,GAMAL H E,CAIRE G.On maximum likelihood detection and the search for the closest lattice point[J].IEEE Transactions on Information Theory,2003,49(10):2389-2402.
  • 8SCHNORR C P,EUCHNER M.Lattice basis reduction:Improved practical algorithms and solving subset sum problems[J].Mathematical Programming,1994,66(1/2/3):181-191.
  • 9ZHAO W,GINNAKIS G B.Sphere decoding algorithms with improved radius search[J].IEEE Transactions on Communications,2005,53(7):1104-1109.
  • 103GPPTS36.211 v9.1.0,Physical channels and modulation:Release 9[S] ,2010.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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