Multibeam 1-Bit Coding Programmable Metasurface Based on Superposition Method

IF 4.8 2区 计算机科学 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Antennas and Wireless Propagation Letters Pub Date : 2024-12-02 DOI:10.1109/LAWP.2024.3509587
Yanjun Du;Jianming Huang;Naibo Zhang;Yansong Cui;Weizheng Ren
{"title":"Multibeam 1-Bit Coding Programmable Metasurface Based on Superposition Method","authors":"Yanjun Du;Jianming Huang;Naibo Zhang;Yansong Cui;Weizheng Ren","doi":"10.1109/LAWP.2024.3509587","DOIUrl":null,"url":null,"abstract":"This letter proposed an algorithm utilizing the continuous phase superposition method to efficiently code multibeam 1-bit programable metasurface array. This method enables rapid metasurface array multibeam coding, which involves first calculating and superimposing the continuous phase matrix, and then the resulting code matrix is discretized. Additionally, an optimized algorithm is presented to lower the complexity of the overall procedure. The proposed algorithm enables the direct calculation of a maximum of 32 beam codes. The proposed algorithm exhibits high computational speed, low hardware resource consumption, and achieves high accuracy in generating beam pointing. The proposed algorithm addresses the issue of combining the number of beams, processing speed, and accuracy in the calculation of metasurface coding, which is not possible with standard algorithms. The algorithm is tested and validated using a 64 × 64 scale 1-bit metasurface array with meta-element full-wave simulation. During the test, 32 independent beams with arbitrary pointing directions are generated by the proposed algorithm. A maximum off-axis angle of 45° for the scanning range is supported by the proposed algorithm. Generated beams are both independent and clear, and the beam pointing error is limited to a maximum of 0.25%. The proposed algorithm for dual-beam coding achieves an average computation time of 1.18 ms, which is about 30 000 times faster than the typical nonlinear iterative optimization algorithm that takes 38 s.","PeriodicalId":51059,"journal":{"name":"IEEE Antennas and Wireless Propagation Letters","volume":"24 3","pages":"602-606"},"PeriodicalIF":4.8000,"publicationDate":"2024-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Antennas and Wireless Propagation Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10772064/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

This letter proposed an algorithm utilizing the continuous phase superposition method to efficiently code multibeam 1-bit programable metasurface array. This method enables rapid metasurface array multibeam coding, which involves first calculating and superimposing the continuous phase matrix, and then the resulting code matrix is discretized. Additionally, an optimized algorithm is presented to lower the complexity of the overall procedure. The proposed algorithm enables the direct calculation of a maximum of 32 beam codes. The proposed algorithm exhibits high computational speed, low hardware resource consumption, and achieves high accuracy in generating beam pointing. The proposed algorithm addresses the issue of combining the number of beams, processing speed, and accuracy in the calculation of metasurface coding, which is not possible with standard algorithms. The algorithm is tested and validated using a 64 × 64 scale 1-bit metasurface array with meta-element full-wave simulation. During the test, 32 independent beams with arbitrary pointing directions are generated by the proposed algorithm. A maximum off-axis angle of 45° for the scanning range is supported by the proposed algorithm. Generated beams are both independent and clear, and the beam pointing error is limited to a maximum of 0.25%. The proposed algorithm for dual-beam coding achieves an average computation time of 1.18 ms, which is about 30 000 times faster than the typical nonlinear iterative optimization algorithm that takes 38 s.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于叠加法的多波束1位编码可编程超表面
本文提出了一种利用连续相位叠加法对多波束1位可编程超表面阵列进行高效编码的算法。该方法实现了超表面阵列多波束的快速编码,首先对连续相位矩阵进行计算和叠加,然后对得到的编码矩阵进行离散化。此外,还提出了一种优化算法,降低了整个过程的复杂度。所提出的算法能够直接计算最多32个波束码。该算法具有计算速度快、硬件资源消耗少、生成波束指向精度高的特点。该算法解决了在计算超表面编码时兼顾波束数、处理速度和精度的问题,这是标准算法无法做到的。采用64 × 64规模的1位元表面阵列和元元全波仿真对算法进行了测试和验证。在测试过程中,该算法产生了32个指向任意方向的独立波束。该算法支持的扫描范围最大离轴角为45°。生成的光束独立清晰,光束指向误差最大控制在0.25%以内。本文提出的双波束编码算法的平均计算时间为1.18 ms,比典型的非线性迭代优化算法(38 s)快约3万倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
8.00
自引率
9.50%
发文量
529
审稿时长
1.0 months
期刊介绍: IEEE Antennas and Wireless Propagation Letters (AWP Letters) is devoted to the rapid electronic publication of short manuscripts in the technical areas of Antennas and Wireless Propagation. These are areas of competence for the IEEE Antennas and Propagation Society (AP-S). AWPL aims to be one of the "fastest" journals among IEEE publications. This means that for papers that are eventually accepted, it is intended that an author may expect his or her paper to appear in IEEE Xplore, on average, around two months after submission.
期刊最新文献
2025 Index IEEE Antennas and Wireless Propagation Letters A Real-Time Beam Pattern Synthesis Method for Variable Curvature Cylindrical Conformal Array Based on Neural Network Antenna Optimization Design Using an Inertia-Weight-Enhanced Particle Swarm Optimization Based on a Heuristic Single-Core Sampling Circularly Polarized Ridge Gap Waveguide Antenna Using Composite Transverse-Longitudinal Slots for SatCom Systems Radiation Pattern Control in Wideband Low-Profile Horizontally Polarized Slot Antenna Design for Wi-Fi 6E/7 Routers
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1