Two low-complexity high-performance linear precoding schemes for secure spatial modulation

In this work, we investigate linear precoding for secure spatial modulation. With secure spatial modulation, the achievable secrecy rate does not have an easy-to-compute mathematical expression, and hence, has to be evaluated numerically, which leads to high complexity in the optimal precoder design. To address this issue, an accurate and analytical approximation of the secrecy rate is derived in this work. Using this approximation as the...