2. Guo Zhi-heng, Li Li-hua, Tao Xiao-feng. Fast ordering detection algorithm for V-BLAST system. The Journal of Beijing University of Posts and Telecommunications, 2007, 30(4): 83-87 (in Chinese)
3. Tang Yi-bing, Hou Xiao-yun, Zheng Bao-yu. Novel sphere decoding algorithm with improved radius search. TheJournal of Chongqing University of Posts and Telecommunications, 2006, 18(S1): 51-54 (in Chinese)
4. Jaldén J, Ottersten B. On the complexity of sphere decoding in digital communications. IEEE Transactions on Signal Processing, 2005, 53(4): 1474-1484
5. Windpassinger C, Lampe L, Fischer R F. A performance study of MIMO detectors. IEEE Transactions on Wireless Communications, 2006, 5(8): 2004-2008
6. Fincke U, Pohst M. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Mathematics of Computation, 1985, 44(5): 463-471
7. Viterbo E, Boutros J. A universal lattice code decoder for fading channels. IEEE Transactions on Information Theory, 1999, 45(5): 1639-1642
8. Agrell E, Eriksson T, Vardy A, et al. Closest point search in lattices. IEEE Transactions on Information Theory, 2002, 48(8): 2201-2214
9. Damen M O, Gamal H E, Caire G. On maximum-likelihood detection and the search for the closest lattice point. IEEE Transactions on Information Theory, 2003, 49(10): 2389-2402
10. Hochwald B, Brink S T. Achieving near-capacity on a multiple antenna channel. IEEE Transactions on Communications, 2003, 51(3): 389-399
11. Golub G H, Charles F L. Matrix computations.Baltimore, US: Johns Hopkins University Press, 1996
12. Parhami B. Computer arithmetic, algorithms and hardware designs. Oxford, UK: Oxford University Press, 2000