期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种低复杂度的MIMO预处理球形译码算法 被引量：2

A Low Complexity Pre-processed Sphere Decoding Algorithm for MlMO Detection
下载PDF
导出
摘要 提出了一种新的低复杂度MIMO预处理球形译码算法。球形译码算法是MIMO译码方案达到最大似然性能的低复杂度译码算法,但当信噪比较低或调制阶数较高时,该算法的复杂度仍然很大,甚至接近穷尽搜索方法的复杂度。本文利用迫零译码的初始估值作为软信息,对信道矩阵各列进行重排列,从而改变解向量中各维信号的求解顺序,因此大大减少了低信噪比或较高调制阶数的球形译码计算复杂度。仿真结果表明,当Eb/No为0～3时,16QAM调制方式下的V-BLAST译码复杂度减少了近1/3。 A new low complexity pre-processed sphere decoding algorithm for multiple-input multiple-output （MIMO） detection is proposed. The sphere decoding is a low complexity algorithm which may achieve the maximum-likelihood performance, but the complexity is still high when the Signal-to-Noise （SNR） is low or the modulation is in high order, and the complexity even approaches to the brutal search method. The columns of the channel matrix have been rearranged according to the soft information gotten from the zero- forcing decoding, so the order of the solution changed accordingly. This reduces the complexity of the sphere decoding greatly when the SNR is low or the modulation is high order. The result of simulation demonstrates that the complexity has been reduced nearly 1/3 when Eb/No in the range of 0 -3 and using the 16QAM modulation.
作者 李庆坤 马红光 李正生 左广霞
机构地区 第二炮兵工程学院
出处 《信号处理》 CSCD 北大核心 2009年第12期1867-1870,共4页 Journal of Signal Processing
关键词 低复杂度 预处理 球形译码 low complexity pre-processed sphere decoding
分类号 TP301.5 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献10

  • 1G. J. Foschini and M. J. Gans, On limits .of wireless communication in a fading environment when using multiple antennas [ J ]. Wireless Personal Commun, Vol. 6, No 3, 1998,pp :311-335.
  • 2Chan A M, Lee I. A new reduced-complexity sphere decoder for multiple antenna systems [ J ]. in Proc. IEEE International Conference on Communication, ICC. New York, USA. 2002. pp: 460-464.
  • 3Hassibi B, Cikalo H. On the sphere-decoding algorithm I. expected complexity [ J ]. IEEE Trans. On Signal Processing. Vol. 53, No. 8, August 2005. pp: 2806-2818.
  • 4G. Foschini, G. Golden, R. Valenzuela and P. Wolniansky. Simplified processing for high spectral efficiency wireless communication employing multi-element arrays [ J ]. IEEE J. Select. Areas Commun. Vol. 17, No. 11, Nov. 2000, pp: 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. Vol. 49, No. 10, 2003, pp: 2389-2402.
  • 6Fincke U, Pohst M. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis [J]. Math. Comput. Vol. 44, No. 4,1985, pp :463-471.
  • 7Schnorr C P, Euchner M. Lattice basis reduction: Improved practical algorithms and solving subset sum problems [ J]. Math. Programming. Vol. 66,1994, pp: 181-191.
  • 8Wolniansky P W, Fosehini G J, Golden G D, et al. V- BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel [ A ]. in Proc. IEEE International Symposium on Signal, Systems, and Electronic, ISSSE. Pisa, Italy. 1998. pp : 295-300.
  • 9Su K, Wassell L J. A new ordering for efficient sphere decoding [ A ]. in Proc. IEEE International Conference on Communications, ICC. Seoul, Korea :2005. pp : 1906-1910.
  • 10Shayegh F, Soleymani M R. Low complexity implementations of sphere decoding for MIMO detection [ C]. CCECE 2008. Canadian Conference on. 4-7 May 2008, Niagara Falls, ON. pp : 000821-000826.

同被引文献26

  • 1VIAKALO H, HASSIBI B. On the sphere-decoding algo- rithm Ⅱ. Generalizations, second-order statistics, and ap- plications to communicati0ns[J].IEEE Transactions on the Signal Processing, 2005,53 (8) : 2819-2834.
  • 2DAMEN 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.
  • 3BARBERO L G, THOMPSON J S. Fixing the complexity of the sphere decoder for MIMO detection[J].IEEE Transactions on Wireless Communications, 2008,7 (6) : 2131-2141.
  • 4DINGY H, WANG Y, DIOURIS J F. Robust fixed com- plexity sphere decoder[C]//IEEE Global Telecommunica- tions Conference. [s. 1.] :IEEE,2010.
  • 5WOLNIANSKY P W, FOSCHINI G J, GOLDEN G D, et al. V-BLASTt An architecture for realizing very high data rates over the rich-scattering wireless channel[C]//in Proc URSI International Symposium on Signals, Systems and Electronies(ISSSE 98). Atlantat IEEE,1998,295-300.
  • 6WIESEL A, MESTRE X, PAGES A, et al. Efficient Im- plementation of sphere demodulation[J]. IEEE Workshop on Signal Processing Advances in Wireless Communica- tions, 2003,4 : 36-40.
  • 7DAI Y M, YAN Z Y. Memory-constrained tree search de- tection and new ordering schemes[J]. IEEE Journal of Se- lected Topics in Signal Processing, 2009,3 (6) : 1026-1037.
  • 8WU X B, DAI Y M, YAN Z Y, et al. Improving the relia- bility of the k-best algorithm for MIMO detection with or- dering[C]//Wireless and Optical Communications Confer- ence. [s. 1.]IEEE,2010.
  • 9WU X B, DAI Y M, WANG Y, et al. Efficient ordering schemes for high-throughput MIMO detectors[J]. Journal of Signal Processing Systems,2010,64(1):61-74.
  • 10SHAYEGH F, SOLEYMANI M R. Low complexity im- plementations of sphere decoding for MIMO detection [C]//Electrical and Computer Engineering. Canada: IEEE, 2008 : 821-825.

引证文献2

二级引证文献3

信号处理
2009年 第12期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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