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

低成本物理层安全设计用于IRS辅助的mMIMO系统与一位DAC

Low-Cost Physical-Layer Security Design for IRS-Assisted mMIMO Systems with One-Bit DACs

University of Electronic Science and Technology of China(电子科技大学);Beijing Institute of Technology(北京理工大学);Laboratory of Electromagnetic Space Cognition and Intelligent Control(电磁空间认知与智能控制实验室);Tianfu Jiangxi Laboratory(天府江西实验室)

Weijie Xiong, Jian Yang, Jingran Lin, Hongli Liu, Zhiling Xiao, Qiang Li

AI总结:

本文提出低成本的物理层安全设计,通过联合优化发射端的一位量化预编码和IRS的常模相移,提升mMIMO系统在IRS辅助下的保密性能。

摘要:

将大规模多输入多输出(mMIMO)系统与智能反射表面(IRS)相结合,为无线通信中的物理层安全(PLS)提升提供了一个有前途的范式。然而,在大规模mMIMO阵列中部署高分辨率量化器,以及众多IRS元件,会导致显著的硬件复杂性。为了解决这些挑战,本文提出了一种低成本的PLS设计,用于IRS辅助的mMIMO系统,通过使用一位数字-模拟转换器(DAC)。重点是联合优化发射端的一位量化预编码和IRS的常模相移,以最大化保密率。这导致了一个高度非凸的分数保密率最大化(SRM)问题。为了高效解决这个问题,提出了两种算法:(1)WMMSE-PDD算法,通过加权最小均方误差(WMMSE)方法将SRM问题转化为一系列非分数程序,并通过惩罚对偶分解(PDD)方法求解,实现优越的保密性能;(2)精确惩罚乘积黎曼梯度下降(EPPRGD)算法,将SRM问题转化为一个无约束优化问题,消除了辅助变量,从而实现更快的收敛,但以稍低的保密性能为代价。两种算法在每次迭代中都提供解析解,并被证明收敛到Karl-Tucker点。仿真结果证实了所提出方法的有效性,并突显了各自的优势。

英文摘要:

Integrating massive multiple-input multiple-output (mMIMO) systems with intelligent reflecting surfaces (IRS) presents a promising paradigm for enhancing physical-layer security (PLS) in wireless communications. However, deploying high-resolution quantizers in large-scale mMIMO arrays, along with numerous IRS elements, leads to substantial hardware complexity. To address these challenges, this paper proposes a cost-effective PLS design for IRS-assisted mMIMO systems by employing one-bit digital-to-analog converters (DACs). The focus is on jointly optimizing one-bit quantized precoding at the transmitter and constant-modulus phase shifts at the IRS to maximize the secrecy rate. This leads to a highly non-convex fractional secrecy rate maximization (SRM) problem. To efficiently solve this problem, two algorithms are proposed: (1) the WMMSE-PDD algorithm, which reformulates the SRM problem into a sequence of non-fractional programs with auxiliary variables using the weighted minimum mean-square error (WMMSE) method and solves them via the penalty dual decomposition (PDD) approach, achieving superior secrecy performance; and (2) the exact penalty product Riemannian gradient descent (EPPRGD) algorithm, which transforms the SRM problem into an unconstrained optimization over a product Riemannian manifold, eliminating auxiliary variables and enabling faster convergence with a slight trade-off in secrecy performance. Both algorithms provide analytical solutions at each iteration and are proven to converge to Karush-Kuhn-Tucker (KKT) points. Simulation results confirm the effectiveness of the proposed methods and highlight their respective advantages.

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

↑