基于序列凸优化的最大稀疏近场形聚焦阵列

Z. Huang, Y. Cheng
{"title":"基于序列凸优化的最大稀疏近场形聚焦阵列","authors":"Z. Huang, Y. Cheng","doi":"10.1109/APCAP.2018.8538091","DOIUrl":null,"url":null,"abstract":"The design of sparse arrays with a minimum number of elements is an emerging field of study as it can reduce the cost and complexity of near-field antenna arrays. A sequential convex optimization based method is proposed to obtain the op- timal array locations and excitations. A numerical example is presented to show the effectiveness of the proposed method, where the synthesized layout consisted of only 41 elements can achieved the same 3dB beamwidth and peak sidelobe level radi- ated by a uniformly spaced array consisted of121 elements.","PeriodicalId":198124,"journal":{"name":"2018 IEEE Asia-Pacific Conference on Antennas and Propagation (APCAP)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Maximally Sparse Near-field Shaped Focusing Arrays by Sequential Convex Optimization\",\"authors\":\"Z. Huang, Y. Cheng\",\"doi\":\"10.1109/APCAP.2018.8538091\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The design of sparse arrays with a minimum number of elements is an emerging field of study as it can reduce the cost and complexity of near-field antenna arrays. A sequential convex optimization based method is proposed to obtain the op- timal array locations and excitations. A numerical example is presented to show the effectiveness of the proposed method, where the synthesized layout consisted of only 41 elements can achieved the same 3dB beamwidth and peak sidelobe level radi- ated by a uniformly spaced array consisted of121 elements.\",\"PeriodicalId\":198124,\"journal\":{\"name\":\"2018 IEEE Asia-Pacific Conference on Antennas and Propagation (APCAP)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Asia-Pacific Conference on Antennas and Propagation (APCAP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCAP.2018.8538091\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Asia-Pacific Conference on Antennas and Propagation (APCAP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCAP.2018.8538091","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

最小单元数稀疏阵列的设计是一个新兴的研究领域,因为它可以降低近场天线阵列的成本和复杂性。提出了一种基于序贯凸优化的阵列最优位置和激励求解方法。通过数值算例验证了所提方法的有效性,其中41个单元的合成布局可以获得与121个单元的均匀间隔阵列相同的3dB波束宽度和峰值旁瓣电平。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Maximally Sparse Near-field Shaped Focusing Arrays by Sequential Convex Optimization
The design of sparse arrays with a minimum number of elements is an emerging field of study as it can reduce the cost and complexity of near-field antenna arrays. A sequential convex optimization based method is proposed to obtain the op- timal array locations and excitations. A numerical example is presented to show the effectiveness of the proposed method, where the synthesized layout consisted of only 41 elements can achieved the same 3dB beamwidth and peak sidelobe level radi- ated by a uniformly spaced array consisted of121 elements.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信