Abstract
In this letter, two kinds of improved sphere decoding (SD) algorithms for generalized spatial modulation (GSM), termed the tree search SD (T-SD) and the path search SD (P-SD), are proposed to provide greater complexity reduction compared with the conventional SD algorithms by merging the repeating elements of the vectors. Simulation results show that the proposed T-SD and P-SD can reduce the complexity dramatically while maintaining the optimum bit-error-ratio performance, especially for high spectral efficiency GSM. Furthermore, P-SD breaks the limitation on the number of transmit antennas and receive antennas.
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.
