A Unified Precoding Scheme for Generalized Spatial Modulation

Publication Type:
Journal Article
Citation:
IEEE Transactions on Communications, 2018, 66 (6), pp. 2502 - 2514
Issue Date:
2018-06-01
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
0D85A0D0-0F2E-4737-9A12-871698068856.pdfAccepted Manuscript Version4.79 MB
Adobe PDF
© 1972-2012 IEEE. Generalized spatial modulation (GSM) activates Nt (1 ≤ nt < Nt) available transmit antennas, and information is conveyed through nt modulated symbols as well as the index of the nt activated antennas. GSM strikes an attractive tradeoff between spectrum efficiency and energy efficiency. Linear precoding that exploits channel state information at the transmitter enhances the system error performance. For GSM with nt=1 (the traditional SM), the existing precoding methods suffer from high computational complexity. On the other hand, GSM precoding for nt ≥ 2 is not thoroughly investigated in the open literature. In this paper, we develop a unified precoding design for GSM systems, which universally works for all nt values. Based on the maximum minimum Euclidean distance criterion, we find that the precoding design can be formulated as a large-scale nonconvex quadratically constrained quadratic program problem. Then, we transform this challenging problem into a sequence of unconstrained subproblems by leveraging augmented Lagrangian and dual ascent techniques. These subproblems can be solved in an iterative manner efficiently. Numerical results show that the proposed method can substantially improve the system error performance relative to the GSM without precoding and features extremely fast convergence rate with a very low computational complexity.
Please use this identifier to cite or link to this item: