全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

简化的固定复杂度球型译码算法

DOI: 10.13190/j.jbupt.2015.04.004, PP. 15-18

Keywords: 多天线系统,固定复杂度,球型译码算法,裁剪半径

Full-Text   Cite this paper   Add to My Lib

Abstract:

提出一种适用于多输入多输出通信系统的简化的固定复杂度球型译码算法.研究多天线接收信号的概率分布,根据接收信号满足卡方分布的特性,提出利用累计分布函数,结合检测错误上限,确定裁剪半径,将检测过程中大于该裁剪半径的节点裁剪掉.仿真结果表明,简化的固定复杂度球型译码算法在高信噪比的情况下,可以有效降低计算复杂度.

References

[1]  Paulraj A J, Gore D A, Nabar R U. An overview of MIMO communications—a key to gigabit wireless[J]. Proceedings of the IEEE, 2004, 92(2): 198-218.
[2]  Goldsmith A, Jafar S A, Jindal N. Capacity limits of MIMO channels[J]. Selected Areas in Communications, IEEE Journal on, 2003, 21(5): 684-702.
[3]  Golden G D, Foschini C J, Valenzuela R A. Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture[J]. Electronics Letters, 1999, 35(1): 14-16.
[4]  Vikalo H, Hassibi B. On the sphere-decoding algorithm II generalizations, second-order statistics, and applications to communications[J]. Signal Processing, IEEE Transactions on, 2005, 53(8): 2819-2834.
[5]  Xu Chong, Gharavi H. A low-complexity solution to decode diversity-oriented block codes in MIMO systems with inter-symbol interference[J]. IEEE Transactions on Wireless Communications, 2012, 11(10): 3574-3587.
[6]  芮国胜, 张海波, 张洋, 等. 接近最优检测性能的低复杂度线性并行MIMO检测算法[J]. 通信学报, 2013, 34(2): 8-14. Rui Guosheng, Zhang Haibo, Zhang Yang, et al. Low complexity linear parallel detection algorithm for near ML detection of MIMO systems[J]. Journal on Communications, 2013, 34(2): 8-14.
[7]  Hiraga K, Sakamoto K, Arai M. An SD method utilizing null dependency on transmission distance due to two-ray fading[J]. IEEE Antennas and Wireless Propagation Letters, 2014, 13: 126-129.
[8]  彭文杰, 李岳衡, 居美艳, 等. 复合衰落信道下分布式MIMO系统下行中断概率分析[J]. 通信学报, 2014, 35(6): 161-168. Peng Wenjie, Li Yueheng, Ju Meiyan, et al. Downlink outage probability analysis of distributed MIMO systems over a composite fading channel[J]. Journal on Communications, 2014, 35(6): 161-168.
[9]  Fincke U, Pohst M. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis[J]. Mathematics of Computation, 1985, 44(170): 463-471.
[10]  Schnorr C P, Euchner M. Lattice basis reduction: improved practical algorithms and solving subset sum problems[J]. Mathematical Programming, 1994, 66(8): 181-199.
[11]  Viterbo E, Boutros J. A universal lattice code decoder for fading channels[J]. IEEE Transactions on Information Theory, 1999, 45(5): 1639-1642.
[12]  Aulin T M. Breadth-first maximum likelihood sequence detection: basics[J]. IEEE Transactions on Communications, 1999, 47(2): 208-216.
[13]  Aulin T M. Breadth-first maximum-likelihood sequence detection: geometry[J]. IEEE Transactions on Communications, 2003, 51(12): 2071-2080.
[14]  Barbero 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-2142.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133