Abstract
Generalized spatial modulation (GSM) is a relatively new multi-input multi-output transmission technique that enables a flexible trade-off between the achievable transmission rate and the cost of radio frequency chains. However, due to the constraint of transmit antenna combination and the variation of interchannel interference, the efficient low-complexity demodulation of GSM signals is challenging, especially when soft demodulation is needed. In this paper, we propose two low-complexity algorithms based on the deterministic sequential Monte Carlo (SMC) technique for the demodulation of GSM. The type-I SMC demodulator, which uses the conventional successive interference cancellation as the kernel and draws antenna-wise samples from the extended constellation, is proposed for the overdetermined GSM system. The type-II SMC demodulator, which consists of two stages and uses the orthogonal matching pursuit as the kernel in the first stage, is proposed for the underdetermined GSM system. A key component in both algorithms is an efficient online scheme to eliminate the illegal samples during the sampling process. Both proposed algorithms achieve near-optimal performances with complexity linear in terms of the antenna size. Moreover, owing to their soft-input soft-output nature, they can be employed in a turbo receiver for a coded GSM system.
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.
