A Method of Reducing the Complexity of Sphere Decoder in the High-Condition Number Channel

Chan A M and Lee Inkyu. A new reduced-complexity spheredecoder for multiple antenna systems. IEEE ICC, New York,2002, 1: 460-464.[2]Pham D, Pattipati K R, and Willett P K, et al.. An improvedcomplex sphere decoder for V-BLAST systems[J].IEEE SignalProcessing Letters.2004, 11(9):748-751[3]Fukatani T, Matsumoto R, and Uyematsu T. Two methodsfor decreasing the computational complexity of the MIMOML decoder. IEICE Trans. on Fundamental, 2004, 87(10):2571-2576.[4]Kawai H et al.. Adaptive control of surviving symbol replicacandidates in QRM-MLD for OFDM MIMO multiplexing[J].IEEE Journal on Selected Areas in Comunications.2006, 24:1130-1140[5]Mobasher A and Taherzadeh M, et al.. A near-maximumlikelihooddecoding algorithm for MIMO systems based onsemi-definite programming[J].IEEE Trans. on InformationTheory.2007, 53(11):3869-3886[6]Pham D, Pattipati K R, Willett P K, and Luo J. Ageneralized probabilistic data association detector formultiple antenna systems[J].IEEE Communications Letters.2004, 8(4):205-207[7]Behrouz F B, Zhu Haidong, and Shi Zhenning. Markov chainMonte Carlo algorithms for CDMA and MIMOcommunication systems[J].IEEE Trans. on Signal Processing.2006, 54(5):1896-1906[8]Hassibi B and Vikalo H. On the sphere-decoding algorithm I[J].Expected complexity. IEEE Trans. on Signal Processing.2005, 53(8):2806-2818[9]Arts H, Seethaler D, and Hlawatsch F. Efficient detectionalgorithms for MIMO channels: A geometrical approach toapproximate ML detection[J].IEEE Signal Processing Letters.2003, 51(11):2808-2820