|Table of Contents|

Efficient Sphere Decoding Algorithm with Approximate Maximum-likelihood Performance


Research Field:
Publishing date:


Efficient Sphere Decoding Algorithm with Approximate Maximum-likelihood Performance
ZHANG Qing-chuanSHU FengSUN Jin-tao
School of Electronic Engineering and Optoelectronic Technology,NUST,Nanjing 210094,China
wireless communication multi-antenna system maximum-likelihood detection sphere decoding
Based on the tree search structure of sphere decoder,an efficient detection algorithm,which can approach the performance of maximum-likelihood detection in the multi-antenna system of wireless communication,is proposed.This paper makes the nodes in the bottom of the search tree expand preferentially through inducing the expanding threshold and reduces the number of visited nodes in the search process.The error performance is analyzed and a simple method to determine the expanding threshold is given.The simulation results show the proposed algorithm has much lower computational complexity compared with the conventional sphere decoding methods,only at the price of slightly increasing error probability.With the regulable parameter,it can provide an excellent tradeoff between performance and complexity.


[1]Foschin iG J. Layered space- tim e architecture fo rw ireless commun ication in a fad ing env ironmentw hen using mu lt-i e lem ent antennas[ J]. Be ll Labs Tech J, 1996, 1( 2): 41- 59.
[2] Jiang M, H anzo L. Mu ltiuserM IMO-OFDM for nex tgenera tion w irless system s [ J] . Proceed ing s o f The IEEE, 2007, 95( 7) : 1430- 1469.
[3] H assib i B, H ochw ald B. H igh-rate codes that are linear in space and tim e[ J]. IEEE T rans Inform Theory, 2002, 48( 7): 1804- 1824.
[4] Nabar R U, Bo lcskeiH, Kneubuh ler F W. Fading relay channels: performance lmi its and space- tmi e signa l design[ J]. IEEE J Select Areas Comm un, 2004, 22( 6): 1099- 1109.
[5] Ja lden J, O tte rsten B. The diversity order o f the sem -i de finite relaxztion detector [ J ]. IEEE T rans Inform Theory, 2008, 54( 4): 1406- 1422.
[6] Dam enM O, Gam e lH, Ca ireG. On max im um- like l-i hood detection and the search for the closest lattice po in t[ J]. IEEE Trans Inform Theory, 2003, 49( 8): 2389- 2402.
[7] Jalden J, Ottersten B. On the comp lex ity of sphere decoding in d ig ita l communications[ J]. IEEE Trans Signal Process, 2005, 53( 4): 1474- 1484.
[8] Gow aika r R, H assibi B. S tatistica l prun ing for nearm ax imum likelihood decoding[ J]. IEEE T rans S ignal Process, 2007, 55( 6): 2661- 2675.
[9] Sh im B, K ang I. Sphere decoding w ith a probabilistic tree pruning [ J]. IEEE T rans Signa l Process, 2008, 56( 10): 4867- 4878.
[10] XuW, W angY, Zhou Z, e t a .l S tack based detection a lgo rithm s forV-BLAST w ire less system [ A ]. Proc o f 2004 Internationa l con ference on Comm an ica tions, C irca it and System s, ICCCAS 2004 [ C ]. Chengdu, Ch-i na: IEEE Press, 2004: 149- 153.
[11] Su K. E ffic ientm ax imum likelihood de tection for comm un ica tion ov er M IMO channe ls [ EB /OL] . http: / / www. c .l cam. ac. uk /Research /DTG /pub l-i cations / pub lic /ks349 /Su05B. pd,f 2005.
[12] XuW, W ang Y, Zhou Z, et a.l A computationally eff-i c ient exactML sphere decoder[A]. Proc ofG loba lTelecommanications Conference 2004, GLOBECOM??04 IEEE [ C]. Dallas, USA: IEEE Press, 2004: 2594- 2598.


Last Update: 2010-04-30