Abstract
Two reduced-complexity decoding algorithms for unitary space-time codes based on tree-structured constellation are presented. In this letter original unitary space-time constellation is divided into several groups. Each one is treated as the leaf nodes set of a subtree. Choosing the unitary signals that represent each group as the roots of these subtrees generates a tree-structured constellation. The proposed tree search decoder decides to which sub tree the receive signal belongs by searching in the set of subtree roots. The final decision is made after a local search in the leaf nodes set of the selected sub tree. The adjacent subtree joint decoder performs joint search in the selected sub tree and its “surrounding” subtrees, which improves the Bit Error Rate (BER) performance of purely tree search method. The exhaustively search in the whole constellation is avoided in our proposed decoding algorithms, a lower complexity is obtained compared to that of Maximum Likelihood (ML) decoding. Simulation results have also been provided to demonstrate the feasibility of these new methods.
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.
