Multibeam 1-Bit Coding Programmable Metasurface Based on Superposition Method

IF 3.7 2区 计算机科学 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC
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":3.7000,"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.
求助全文
约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.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信