TY - JOUR
T1 - Hybrid tree search algorithms for detection in spatial multiplexing systems
AU - Lai, Kuei Chiang
AU - Jia, Jiun Jie
AU - Lin, Li Wei
N1 - Funding Information:
Manuscript received August 9, 2010; revised December 30, 2010 and March 29, 2011; accepted April 27, 2011. Date of publication June 23, 2011; date of current version September 19, 2011. This work was supported by the National Science Council, Taiwan, under Contract NSC 97-2221-E-006-083-MY3. The review of this paper was coordinated by Dr. C. Ling. Part of this paper was presented at the IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications, Toronto, ON, Canada, September 2011.
PY - 2011/9
Y1 - 2011/9
N2 - Hybrid tree search algorithms are described for maximum-likelihood symbol detection in spatial multiplexing (SM) systems. Essentially, the search tree is iteratively expanded in breadth-first (BF) manner until the probability that the current most likely path is correct exceeds the specified threshold, at which point, the depth-first (DF) stage is initiated to traverse the rest of the tree. In contrast with the sphere decoding (SD) algorithm, which starts off with the DF search, the proposed algorithms use the BF stage to enhance the accuracy of the initial DF search direction by exploiting the diversity inherent in the SM scheme. Simulation results demonstrate that, with a moderate increase in the memory requirement, the proposed algorithms achieve a significantly lower complexity than the SD algorithm in many scenarios.
AB - Hybrid tree search algorithms are described for maximum-likelihood symbol detection in spatial multiplexing (SM) systems. Essentially, the search tree is iteratively expanded in breadth-first (BF) manner until the probability that the current most likely path is correct exceeds the specified threshold, at which point, the depth-first (DF) stage is initiated to traverse the rest of the tree. In contrast with the sphere decoding (SD) algorithm, which starts off with the DF search, the proposed algorithms use the BF stage to enhance the accuracy of the initial DF search direction by exploiting the diversity inherent in the SM scheme. Simulation results demonstrate that, with a moderate increase in the memory requirement, the proposed algorithms achieve a significantly lower complexity than the SD algorithm in many scenarios.
UR - http://www.scopus.com/inward/record.url?scp=80052860118&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80052860118&partnerID=8YFLogxK
U2 - 10.1109/TVT.2011.2160464
DO - 10.1109/TVT.2011.2160464
M3 - Article
AN - SCOPUS:80052860118
SN - 0018-9545
VL - 60
SP - 3503
EP - 3509
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
IS - 7
M1 - 5928440
ER -