|Table of Contents|

[1] Xiang Xingyu, Zhong Wen,. Novel K-best detection algorithms for MIMO system [J]. Journal of Southeast University (English Edition), 2009, 25 (1): 1-5. [doi:10.3969/j.issn.1003-7985.2009.01.001]
Copy

Novel K-best detection algorithms for MIMO system()
Share:

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:
25
Issue:
2009 1
Page:
1-5
Research Field:
Information and Communication Engineering
Publishing date:
2009-03-30

Info

Title:
Novel K-best detection algorithms for MIMO system
Author(s):
Xiang Xingyu Zhong Wen
National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China
Keywords:
sorted QR decomposition K-best sphere decoding maximum-likelihood detection minimum mean square error
PACS:
TN91
DOI:
10.3969/j.issn.1003-7985.2009.01.001
Abstract:
Aiming at the optimum path excluding characteristics and the full constellation searching characteristics of the K-best detection algorithm, an improved-performance K-best detection algorithm and several reduced-complexity K-best detection algorithms are proposed.The improved-performance K-best detection algorithm deploys minimum mean square error(MMSE)filtering of a channel matrix before QR decomposition.This algorithm can decrease the probability of excluding the optimum path and achieve better performance.The reduced-complexity K-best detection algorithms utilize a sphere decoding method to reduce searching constellation points.Simulation results show that the improved performance K-best detection algorithm obtains a 1 dB performance gain compared to the K-best detection algorithm based on sorted QR decomposition(SQRD).Performance loss occurs when K=4 in reduced complexity K-best detection algorithms.When K=8, the reduced complexity K-best detection algorithms require less computational effort compared with traditional K-best detection algorithms and achieve the same performance.

References:

[1] Telatar E.Capacity of multi-antenna Gaussian channels [J].European Transactions on Telecommunications, 1999, 6(10):585-595.
[2] Hassibi B, Vikalo H.On the sphere-decoding algorithm Ⅰ: expected complexity[J].IEEE Trans Signal Processing, 2005, 53(8):2806-2818.
[3] Jalden J, Ottersten B.On the complexity of sphere decoding in digital communications[J].IEEE Trans Signal Processing, 2005, 53(4):1474-1484.
[4] Damen M O, Gamal H E, Caire G.On maximum-likelihood detection and the search for the closest lattice point[J].IEEE Trans Inform Theory, 2003, 49(10):2389-2402.
[5] Li Qingwei, Wang Zhongfeng.Improved K-best sphere decoding algorithms for MIMO systems[C]//Proc ISCAS. Kos Island, Greece, 2006:1159-1162.
[6] Fukatani T, Matsumoto R, Uyematsu T.Two methods for decreasing the computational complexity of the MIMO ML decoder[J].IEICE Trans Fundamentals, 2004, E87-A(10):2571-2576.
[7] Choi Sang-Ho, Ko Yong-Chai.Implementation-friendly QRM-MLD using trellis-structure based on Viterbi algorithm[C]//Proc PIMRC.Athens, Greece, 2007:1-5.
[8] Wubben D, Bohnke R, Rinas J.Efficient algorithm for decoding layered space-time codes[J].Electron Lett, 2001, 37(1):1348-1350.
[9] Bohnke R, Wubben D, Kuhn V, et al.Reduced complexity MMSE detection for BLAST architectures[C]//Proc IEEE Globecom.San Francisco, USA, 2003, 4:2258-2262.

Memo

Memo:
Biographies: Xiang Xingyu(1980—), male, graduate;Zhong Wen(corresponding author), female, doctor, associate professor, wzhong@seu.edu.cn.
Foundation items: The National High Technology Research and Development Program of China(863 Program)(No.2006AA01Z264), the National Natural Science Foundation of China(No.60572072).
Citation: Xiang Xingyu, Zhong Wen.Novel K-best detection algorithms for MIMO system[J].Journal of Southeast University(English Edition), 2009, 25(1):1-5.
Last Update: 2009-03-20