Low-Cost Physical-Layer Security Design for IRS-Assisted mMIMO Systems With 1-bit DACs

IF 8.7 1区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS
Weijie Xiong;Jian Yang;Jingran Lin;Hongli Liu;Zhiling Xiao;Qiang Li
{"title":"Low-Cost Physical-Layer Security Design for IRS-Assisted mMIMO Systems With 1-bit DACs","authors":"Weijie Xiong;Jian Yang;Jingran Lin;Hongli Liu;Zhiling Xiao;Qiang Li","doi":"10.1109/TIFS.2026.3666900","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":13492,"journal":{"name":"IEEE Transactions on Information Forensics and Security","volume":"21 ","pages":"2815-2830"},"PeriodicalIF":8.7000,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Forensics and Security","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11406194/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/2/23 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

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.
具有1位dac的irs辅助mMIMO系统的低成本物理层安全设计
将大规模多输入多输出(mMIMO)系统与智能反射面(IRS)集成为提高无线通信物理层安全性(PLS)提供了一种有前途的范例。然而,在大规模的mMIMO阵列中部署高分辨率量化器,以及大量的IRS元素,会导致大量的硬件复杂性。为了解决这些挑战,本文提出了一种具有成本效益的PLS设计,用于irs辅助的mMIMO系统,采用一位数模转换器(dac)。重点是共同优化发射机的1位量化预编码和IRS的恒定模相移,以最大限度地提高保密率。这导致了一个高度非凸分数保密率最大化(SRM)问题。为了有效地解决这一问题,提出了两种算法:1)WMMSE-PDD算法,该算法利用加权最小均方误差(WMMSE)方法将SRM问题重新表述为带有辅助变量的非分数程序序列,并通过惩罚对偶分解(PDD)方法求解SRM问题,获得了较好的保密性能;2)精确惩罚积黎曼梯度下降(EPPRGD)算法,该算法将SRM问题转化为乘积黎曼流形上的无约束优化,消除了辅助变量,在保密性能略有牺牲的情况下实现了更快的收敛。这两种算法在每次迭代时都提供解析解,并被证明收敛于KKT点。仿真结果验证了所提方法的有效性,并突出了各自的优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Information Forensics and Security
IEEE Transactions on Information Forensics and Security 工程技术-工程:电子与电气
CiteScore
14.40
自引率
7.40%
发文量
234
审稿时长
6.5 months
期刊介绍: The IEEE Transactions on Information Forensics and Security covers the sciences, technologies, and applications relating to information forensics, information security, biometrics, surveillance and systems applications that incorporate these features
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书