System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Hybrid Tree Search Algorithms for Detection in Spatial Multiplexing Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kuei-Chiang Lai ; Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan ; Jiun-Jie Jia ; Li-Wei Lin

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.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:60 ,  Issue: 7 )