高级搜索

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

降低高条件数信道下的球形译码算法复杂度的方法

赵慧 龙航 王文博

赵慧, 龙航, 王文博. 降低高条件数信道下的球形译码算法复杂度的方法[J]. 电子与信息学报, 2009, 31(3): 636-639. doi: 10.3724/SP.J.1146.2007.01876
引用本文: 赵慧, 龙航, 王文博. 降低高条件数信道下的球形译码算法复杂度的方法[J]. 电子与信息学报, 2009, 31(3): 636-639. doi: 10.3724/SP.J.1146.2007.01876
Zhao Hui, Long Hang, Wang Wen-bo. A Method of Reducing the Complexity of Sphere Decoder in the High-Condition Number Channel[J]. Journal of Electronics & Information Technology, 2009, 31(3): 636-639. doi: 10.3724/SP.J.1146.2007.01876
Citation: Zhao Hui, Long Hang, Wang Wen-bo. A Method of Reducing the Complexity of Sphere Decoder in the High-Condition Number Channel[J]. Journal of Electronics & Information Technology, 2009, 31(3): 636-639. doi: 10.3724/SP.J.1146.2007.01876

降低高条件数信道下的球形译码算法复杂度的方法

doi: 10.3724/SP.J.1146.2007.01876
基金项目: 

国家863计划项目(2006AA01Z257)资助课题

A Method of Reducing the Complexity of Sphere Decoder in the High-Condition Number Channel

  • 摘要: MIMO系统中,球形译码可以在保证接近ML检测性能的前提下大大降低检测复杂度。但当信道矩阵条件数很高时,球形译码的复杂度仍然会很高。在分析了这一现象的原因后,本文提出了在高层对权值进行合并的一种球形译码算法,因为其减小了译码搜索过程中对树的高层节点的访问的概率,由此降低了搜索复杂度。仿真结果表明,这种算法在低信噪比、高条件数时可以节约20%的浮点运算操作次数。
  • Chan A M and Lee Inkyu. A new reduced-complexity spheredecoder for multiple antenna systems. IEEE ICC, New York,2002, 1: 460-464.[2]Pham D, Pattipati K R, and Willett P K, et al.. An improvedcomplex sphere decoder for V-BLAST systems[J].IEEE SignalProcessing Letters.2004, 11(9):748-751[3]Fukatani T, Matsumoto R, and Uyematsu T. Two methodsfor decreasing the computational complexity of the MIMOML decoder. IEICE Trans. on Fundamental, 2004, 87(10):2571-2576.[4]Kawai H et al.. Adaptive control of surviving symbol replicacandidates in QRM-MLD for OFDM MIMO multiplexing[J].IEEE Journal on Selected Areas in Comunications.2006, 24:1130-1140[5]Mobasher A and Taherzadeh M, et al.. A near-maximumlikelihooddecoding algorithm for MIMO systems based onsemi-definite programming[J].IEEE Trans. on InformationTheory.2007, 53(11):3869-3886[6]Pham D, Pattipati K R, Willett P K, and Luo J. Ageneralized probabilistic data association detector formultiple antenna systems[J].IEEE Communications Letters.2004, 8(4):205-207[7]Behrouz F B, Zhu Haidong, and Shi Zhenning. Markov chainMonte Carlo algorithms for CDMA and MIMOcommunication systems[J].IEEE Trans. on Signal Processing.2006, 54(5):1896-1906[8]Hassibi B and Vikalo H. On the sphere-decoding algorithm I[J].Expected complexity. IEEE Trans. on Signal Processing.2005, 53(8):2806-2818[9]Arts H, Seethaler D, and Hlawatsch F. Efficient detectionalgorithms for MIMO channels: A geometrical approach toapproximate ML detection[J].IEEE Signal Processing Letters.2003, 51(11):2808-2820
  • 加载中
计量
  • 文章访问数:  3508
  • HTML全文浏览量:  126
  • PDF下载量:  1352
  • 被引次数: 0
出版历程
  • 收稿日期:  2007-12-10
  • 修回日期:  2008-10-06
  • 刊出日期:  2009-03-19

目录

    /

    返回文章
    返回