{"title":"Practical Configuration of a Discrete RIS With Phase-Dependent Amplitude Response","authors":"Mahmoud Saad Abouamer;Patrick Mitran","doi":"10.1109/LCOMM.2024.3468872","DOIUrl":null,"url":null,"abstract":"We consider configuring discrete reconfigurable intelligent surfaces (RIS) with phase-dependent amplitude responses. The problem is formulated as a constrained virtual-channel selection problem. When considered over subsets with maximum phase-variation \n<inline-formula> <tex-math>${\\theta _{\\max }}\\lt \\pi $ </tex-math></inline-formula>\n, the solution is shown to be bounded between two matroid-constrained problems. We illustrate configuration problems whose optimal solution lies within such subsets and show that a greedy framework guarantees a worst-case \n<inline-formula> <tex-math>$|2\\log _{2}\\cos (\\theta _{\\max }/2)|$ </tex-math></inline-formula>\n optimality gap uniformly over all system parameters. Subsequently, a low-complexity framework is proposed for general discrete configuration problems. Numerical experiments show that the framework performs within 4% of the optimal binary-RIS configuration and achieves at least 90% of the continuous phase-shift performance using a 3-bit configuration.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2678-2682"},"PeriodicalIF":3.7000,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10695449/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
We consider configuring discrete reconfigurable intelligent surfaces (RIS) with phase-dependent amplitude responses. The problem is formulated as a constrained virtual-channel selection problem. When considered over subsets with maximum phase-variation
${\theta _{\max }}\lt \pi $
, the solution is shown to be bounded between two matroid-constrained problems. We illustrate configuration problems whose optimal solution lies within such subsets and show that a greedy framework guarantees a worst-case
$|2\log _{2}\cos (\theta _{\max }/2)|$
optimality gap uniformly over all system parameters. Subsequently, a low-complexity framework is proposed for general discrete configuration problems. Numerical experiments show that the framework performs within 4% of the optimal binary-RIS configuration and achieves at least 90% of the continuous phase-shift performance using a 3-bit configuration.
期刊介绍:
The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.