2016/03/12 by T. Lakshmi Narasimhan, Narasimhan, T. Lakshmi, A. Chockalingam +1
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Technologies #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Satellite Communication Systems #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1603.03898
Expanded version of the IEEE Communications Letters paper
arxiv created 2016/03/12 · openalex publication_date 2016/03/12 · arxiv updated 2016/03/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Generalized spatial modulation (GSM) uses N antenna elements but fewer radio frequency (RF) chains (R) at the transmitter. Spatial modulation and spatial multiplexing are special cases of GSM with R=1 and R=N, respectively. In GSM, apart from conveying information bits through R modulation symbols, information bits are also conveyed through the indices of the R active transmit antennas. In this paper, we derive lower and upper bounds on the the capacity of a (N,M,R)-GSM MIMO system, where M is the number of receive antennas. Further, we propose a computationally efficient GSM encoding (i.e., bits-to-signal mapping) method and a message passing based low-complexity detection algorithm suited for large-scale GSM-MIMO systems.