基于交替快速分段循环卷积和FFT的可分离圆柱天线阵有效方向图合成

IF 5.9 1区 计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC
Jialu Sun;Sihao Liu;Deqiang Yang;Junping Geng;Yanhui Liu
{"title":"基于交替快速分段循环卷积和FFT的可分离圆柱天线阵有效方向图合成","authors":"Jialu Sun;Sihao Liu;Deqiang Yang;Junping Geng;Yanhui Liu","doi":"10.1109/TAP.2026.3705819","DOIUrl":null,"url":null,"abstract":"The synthesis of separable uniform cylindrical arrays (SUCAs) remains challenging because decomposing a target pattern into independent uniform linear array (ULA) and uniform circular array (UCA) components is ambiguous and undermines accurate control of the overall pattern. To overcome this, an alternating fast segmented cyclic convolution and fast Fourier transform (AFSCC-FFT) method is proposed. The method models an SUCA as an equivalent UCA with an iterative update element pattern incorporating the ULA factor and the basic element pattern. Thus, the transformations between array pattern and excitations are accelerated by performing inverse FFT (IFFT) and FFT for the ULA part, as well as performing fast segmented cyclic convolution (FSCC) and inverse FSCC for the equivalent UCA, achieving low computational complexity. Pattern constraints are achieved by developing an alternating pattern update strategy that iteratively updates the ULA and equivalent UCA patterns, jointly accounting for both subarray contributions to the total pattern, which effectively avoids amplitude and phase ambiguities used in conventional forced pattern decomposition. Numerical examples and full-wave simulations are conducted to validate the efficiency and accuracy of the proposed method, as well as its superiority over existing approaches.","PeriodicalId":13102,"journal":{"name":"IEEE Transactions on Antennas and Propagation","volume":"74 9","pages":"8550-8562"},"PeriodicalIF":5.9000,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficient Pattern Synthesis of Separable Cylindrical Antenna Array Employing Alternating Fast Segmented Cyclic Convolution and FFT\",\"authors\":\"Jialu Sun;Sihao Liu;Deqiang Yang;Junping Geng;Yanhui Liu\",\"doi\":\"10.1109/TAP.2026.3705819\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The synthesis of separable uniform cylindrical arrays (SUCAs) remains challenging because decomposing a target pattern into independent uniform linear array (ULA) and uniform circular array (UCA) components is ambiguous and undermines accurate control of the overall pattern. To overcome this, an alternating fast segmented cyclic convolution and fast Fourier transform (AFSCC-FFT) method is proposed. The method models an SUCA as an equivalent UCA with an iterative update element pattern incorporating the ULA factor and the basic element pattern. Thus, the transformations between array pattern and excitations are accelerated by performing inverse FFT (IFFT) and FFT for the ULA part, as well as performing fast segmented cyclic convolution (FSCC) and inverse FSCC for the equivalent UCA, achieving low computational complexity. Pattern constraints are achieved by developing an alternating pattern update strategy that iteratively updates the ULA and equivalent UCA patterns, jointly accounting for both subarray contributions to the total pattern, which effectively avoids amplitude and phase ambiguities used in conventional forced pattern decomposition. Numerical examples and full-wave simulations are conducted to validate the efficiency and accuracy of the proposed method, as well as its superiority over existing approaches.\",\"PeriodicalId\":13102,\"journal\":{\"name\":\"IEEE Transactions on Antennas and Propagation\",\"volume\":\"74 9\",\"pages\":\"8550-8562\"},\"PeriodicalIF\":5.9000,\"publicationDate\":\"2026-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Antennas and Propagation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/11581403/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2026/6/26 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Antennas and Propagation","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11581403/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/6/26 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

由于将目标方向图分解为独立的均匀线性阵列(ULA)和均匀圆形阵列(UCA)组件是模糊的,并且破坏了对整体方向图的精确控制,因此可分离均匀圆柱阵列(suca)的合成仍然具有挑战性。为了克服这一问题,提出了一种快速分段循环卷积和快速傅里叶变换交替方法。该方法将一个SUCA建模为一个等效的UCA,该UCA具有包含ULA因子和基本元素模式的迭代更新元素模式。因此,通过对ULA部分进行逆FFT (IFFT)和FFT,以及对等效UCA部分进行快速分段循环卷积(FSCC)和逆FSCC,可以加速阵列方向图与激励之间的转换,从而实现较低的计算复杂度。通过开发交替的模式更新策略来实现模式约束,该策略迭代地更新ULA和等效UCA模式,共同考虑两个子阵列对总模式的贡献,从而有效地避免了传统强制模式分解中使用的幅度和相位模糊。数值算例和全波仿真验证了该方法的有效性和准确性,以及与现有方法相比的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient Pattern Synthesis of Separable Cylindrical Antenna Array Employing Alternating Fast Segmented Cyclic Convolution and FFT
The synthesis of separable uniform cylindrical arrays (SUCAs) remains challenging because decomposing a target pattern into independent uniform linear array (ULA) and uniform circular array (UCA) components is ambiguous and undermines accurate control of the overall pattern. To overcome this, an alternating fast segmented cyclic convolution and fast Fourier transform (AFSCC-FFT) method is proposed. The method models an SUCA as an equivalent UCA with an iterative update element pattern incorporating the ULA factor and the basic element pattern. Thus, the transformations between array pattern and excitations are accelerated by performing inverse FFT (IFFT) and FFT for the ULA part, as well as performing fast segmented cyclic convolution (FSCC) and inverse FSCC for the equivalent UCA, achieving low computational complexity. Pattern constraints are achieved by developing an alternating pattern update strategy that iteratively updates the ULA and equivalent UCA patterns, jointly accounting for both subarray contributions to the total pattern, which effectively avoids amplitude and phase ambiguities used in conventional forced pattern decomposition. Numerical examples and full-wave simulations are conducted to validate the efficiency and accuracy of the proposed method, as well as its superiority over existing approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
10.40
自引率
28.10%
发文量
968
审稿时长
4.7 months
期刊介绍: IEEE Transactions on Antennas and Propagation includes theoretical and experimental advances in antennas, including design and development, and in the propagation of electromagnetic waves, including scattering, diffraction, and interaction with continuous media; and applications pertaining to antennas and propagation, such as remote sensing, applied optics, and millimeter and submillimeter wave techniques
×
引用
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学术官方微信
小红书