An Efficient Detection Algorithm for MIMO Systems Approaching ML Performance

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