arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1806.02272eess.SP
收藏

用于安全空间调制的低复杂度线性预编码

Low-Complexity Linear Precoding for Secure Spatial Modulation

F. Shu, Z. Wang, S. Yan, X. Zhou, J. Li, X. Zhou

摘要:

在这项工作中,我们研究线性预编码的安全空间调制。在安全空间调制的情况下,可实现的保密率不具有易于计算的数学表达式,并且因此必须进行数值评估,这导致最佳预编码器设计的高复杂性。为了解决这个问题,在这项工作中,一个准确的和解析的近似的保密率。以此为目标函数,提出了两种基于梯度下降(GD)和逐次凸逼近(SCA)的低复杂度线性预编码方法。基于GD的方法具有低得多的复杂度,但通常收敛到局部最优。另一方面,基于SCA的方法使用半定松弛来处理预编码器优化问题中的非凸性,并获得近似最优解。与文献中直接使用精确和数值评估的保密容量作为目标函数的现有基于GD的预编码器设计相比,所提出的两种设计具有显着降低的复杂度。我们基于SCA的设计甚至比现有的基于GD的设计实现了更高的保密率。

英文摘要:

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 objective function, two low-complexity linear precoding methods based on gradient descend (GD) and successive convex approximation (SCA) are proposed. The GD-based method has much lower complexity but usually converges to a local optimum. On the other hand, the SCA-based method uses semi-definite relaxation to deal with the non-convexity in the precoder optimization problem and achieves near-optimal solution. Compared with the existing GD-based precoder design in the literature that directly uses the exact and numerically evaluated secrecy capacity as the objective function, the two proposed designs have significantly lower complexity. Our SCA-based design even achieves a higher secrecy rate than the existing GD-based design.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑