Abstract
Generalized Spatial modulation (GSM) uses n t antenna elements but fewer radio frequency chains (n rf ) at the transmitter. Spatial modulation and spatial multiplexing are special cases of GSM with n rf = 1 and n rf = n t , respectively. In GSM, apart from conveying information bits through n rf modulation symbols, information bits are also conveyed through the indices of the active n rf transmit antennas. In this paper, we derive analytical bounds on the code-word and bit error probabilities of maximum likelihood detection in GSM. The bounds are shown to be tight at medium to high signal-to-noise ratios (SNR). We also present a low-complexity detection algorithm based on reactive tabu search (RTS) for GSM in large-scale MIMO systems. Simulation results show that the proposed algorithm performs well and scales well in complexity.
Published Version
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 call