In this paper, we investigate linear precoding for spatial modulation (SM) over multiple-input-multiple-output (MIMO) fading channels. With channel state information avail- able at the transmitter, our focus is to maximize the minimum Eu- clidean distance among all candidates of SM symbols. We prove that the precoder design is a large-scale non-convex quadratically constrained quadratic program (QCQP) problem. However, the conventional methods, such as semi- definite relaxation and it- erative concave-convex process, cannot tackle this challenging problem effectively or efficiently. To address this issue, we leverage augmented Lagrangian and dual ascent techniques, and transform the original large-scale non-convex QCQP problem into a sequence of subproblems. These subproblems can be solved in an iterative manner efficiently. Numerical results show that the proposed method can significantly improve the system error performance relative to the SM without precoding, and features extremely fast convergence rate with very low computational complexity.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Low-Complexity Precoding for Spatial Modulation


    Contributors:
    Cheng, Peng (author) / Chen, Zhuo (author) / Zhang, J. Andrew (author) / Li, Yonghui (author) / Vucetic, Branka (author)


    Publication date :

    2017-09-01


    Size :

    191261 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English





    Precoding Schemes for Wireless Beam Modulation System

    Chen, Xiao / Liu, Congxi / Yu, Xinyan et al. | IEEE | 2024



    Low-Complexity LSQR-Based Linear Precoding for Massive MIMO Systems

    Xie, Tian / Lu, Zhaohua / Han, Qian et al. | IEEE | 2015