多天线系统中逼近最大似然的快速检测算法
doi: 10.3724/SP.J.1146.2005.01390
An Efficient Detection Algorithm for MIMO Systems Approaching ML Performance
-
摘要: 该文针对无编码的多输入多输出无线通信系统中的最大似然检测接收机在发端天线数较多、调制阶数较高时计算复杂度过高的问题，提出了一种低复杂度的球形译码算法。该算法首先利用信道信息对待检测的发送信号矢量进行分组，然后对各组内的信号矢量采用球形译码进行最大似然检测，并在组间做干扰消除。理论分析和仿真表明，该算法不仅复杂度低，而且能够逼近最大似然检测的性能。
-
关键词:
- 移动通信;多天线;最大似然;球形译码
Abstract: An efficient Sphere Decoding (SD) algorithm is proposed for uncoded Multi-Input Multi-Output (MIMO) systems with a large number of antennas and higher modulation constellations. This method utilizes a channel-based group detection strategy. The transmitted symbols on each substream are detected by performing sphere decoding within each group and successive interference canceling between groups. Analyses and simulations demonstrate that the proposed algorithm can approach Maximum Likelihood (ML) detection with a relatively low complexity. -
Jalden J and Ottersten B. On the complexity of sphere decoding in digital communications[J].IEEE Trans. on Signal Proc.2005, 53(4):1474-1484[2]Golden G D, Foschini G J, and Valenzuela R A, et al.. Detection algorithm and initial laboratory results using the V-BLAST space-time communication architecture[J].Electron. Lett.1999, 35(1):14-15[3]Rekaya G and Belfiore J C. Complexity of ML lattice decoders for the decoding of linear full rate space-time codes[C]. IEEE International Symposium on Information Theory (ISIT), Yokohama, Japan, 2003: 206-206.[4]Guo Z and Nilsson P. Reduced complexity Schnorr-Euchner decoding algorithms for MIMO systems[J].IEEE Commun. Lett.2004, 8(5):286-288[5]Kang J W and Kwang B E. Simplified ML detection scheme for MIMO systems[C]. IEEE Vehicular Technology Conference, Orlando, USA, 2004: 824-827.[6]Cui T and Tellambura C. Approximate ML detection for MIMO systems using multistage sphere decoding[J].IEEE Signal Proc. Lett.2005, 12(3):222-225[7]Agrell E, Eriksson T, and Vardy A, et al.. Closest point search in lattices[J].IEEE Trans. on Inform. Theory.2002, 48(8):2201-2214[8]Fincke U and Pohst M. Improved methods for calculating vectors of short length in a lattice, inlcuding a complexity analysis[J].Math. Computat.1985, 44(170):463-471[9]Viterbo E and Boutros J. A universal lattice code decoder for fading channels[J].IEEE Trans. on Inform. Theory.1999, 45(5):1639-1642[10]Hochwald B and Brink S T. Achieving near-capacity on a multipleantenna channel[J].IEEE Trans. on Commun.2003, 51(3):389-399 -
计量
- 文章访问数: 3045
- HTML全文浏览量: 94
- PDF下载量: 955
- 被引次数: 0
下载:
