Abstract
A hybrid tree search algorithm is described for maximum-likelihood symbol detection in spatial multiplexing (SM) systems. Essentially, the search tree is iteratively expanded in the breadth-first (BF) manner until the probability that the current most likely path is correct exceeds a specified threshold, at which point the depth-first (DF) stage is initiated to traverse the rest of the tree. In contrast to the sphere decoding (SD) algorithm, the proposed algorithm uses 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 the proposed algorithm achieves a significantly lower complexity than the SD algorithm in many scenarios of practical interest.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
