arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.7357math.NAcs.NA
收藏

基于轮廓-FFT的谱域大尺寸印制天线阵列MBF分析

Contour-FFT based Spectral Domain MBF Analysis of Large Printed Antenna Arrays

ICTEAM Institute, Université catholique de Louvain(天主教鲁汶大学 ICTEAM 研究所)

Shambhu Nath Jha, Christophe Craeye

AI总结:

本文提出一种快速谱域方法,用于评估由相同印制天线构成的正则和非正则阵列中宏基函数之间的反应项。通过在频域中利用宏基函数的滤波能力,并结合新提出的基于FFT的加速技术,实现高效计算。方法在复杂平面上进行轮廓积分,计算复杂度为N log₂N,且与元素复杂度无关。

摘要:

本文提出了一种快速谱域方法,用于评估由相同印制天线构成的正则和非正则阵列中宏基函数之间的反应项。该技术首先利用宏基函数在频域中的过滤能力。随后,通过新提出的基于FFT的加速技术进行强烈加速,该技术适用于复平面中的轮廓积分。我们将其命名为轮廓-FFT或C-FFT。除了一个通过多极子处理的有效均匀介质项外,对于任何可能的相对位置,子strate相关的反应项的计算复杂度为N log₂N。所提出方法的复杂度与元素复杂度无关。通过所提出方法获得的数值结果与基于传统宏基函数技术的已验证参考解进行比较,观察到极好的一致性。

英文摘要:

A fast spectral-domain method is proposed to evaluate the reaction terms between the Macro Basis Functions in regular and non-regular arrays made of identical printed antennas. The presented technique first exploits the filtering capabilities of the Macro Basis Functions in the spectral domain. The method is then strongly accelerated with the help of a newly formulated Fast Fourier Transform-based technique, which is applicable to a contour integration in the complex plane. We name the method as Contour-FFT or C-FFT. Besides an effective homogeneous medium term treated with multipoles, a computational complexity of order N log_2 N is achieved for the the tabulation of substrate-related reaction terms for any possible relative positions. The complexity of the proposed method is independent from the complexity of the elements. Numerical results obtained with the proposed method are compared with those from a pre-validated reference solution based on the traditional Macro Basis Functions technique; an excellent agreement is observed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑