首页> 外文会议>IEEE Antennas and Propagation Society International Symposium >Multi-level decomposition approach to translational symmetry problems of several dimensions
【24h】

Multi-level decomposition approach to translational symmetry problems of several dimensions

机译:多级分解方法若干维度的翻译对称问题

获取原文

摘要

Summary form only given. Finite antenna arrays consisting of regularly-spaced, arbitrarily-shaped and identical elements exhibit translational symmetry. This property can easily be exploited in conventional planar (2D) arrays, and the concept can also be applied to structures of higher dimensionality. The rigorous analysis of complex antenna elements in a finite array has been successfully carried out using the finite element-boundary integral (FE-BI) method along with a decomposition approach. In these techniques, complicated and distributed systems are modelled by decomposing the structures into like blocks, where possible, for storage and computational savings. This approach is quite efficient in most regards and when applied to finite array problems, we refer to it as the array decomposition method (ADM). It is quite successful for smaller arrays, but results in a linear increase of matrix storage for increasingly large array problems. To counter the storage problem, the approach was extended to include far-zone decomposition via the fast multipole method (FMM) (Kindt, R. and Volakis, J.L., Radio Science, 2003). This newer approach limits the near-zone interaction storage of array systems to a small number of terms. This combination of simultaneous near-zone and far-zone decompositions, the array decomposition-fast multipole method (AD-FMM), results in fixed near-zone matrix storage, and overall storage requirements of O(N) for any sized array with a system with a total of N degrees of freedom. The effectiveness of this approach for several interesting problem types is discussed.
机译:摘要表格仅给出。由规则间隔,任意形状和相同元素组成的有限天线阵列表现出平移对称性。该特性可以在传统的平面(2D)阵列中轻松利用,并且该概念也可以应用于更高维度的结构。使用有限元边界积分(FE-BI)方法以及分解方法成功地执行了有限阵列中复杂天线元件的严格分析。在这些技术中,通过在可能的情况下,通过将结构分解成像存储和计算节省来建模复杂和分布式系统。这种方法在大多数方面和应用于有限阵列问题时,我们将其称为阵列分解方法(ADM)。对于较小的数组来说,它非常成功,但导致矩阵存储的线性增加,越来越大的阵列问题。为了反击存储问题,延长了该方法以包括通过快速多极法(FMM)(Windt,R.和Volakis,J.L.,Radioce,2003)的远区分解。此较新方法将阵列系统的近区域交互存储限制为少数术语。这种同时近区域和远区分解的组合,阵列分解 - 快速多极方法(AD-FMM),导致固定的近区域矩阵存储,以及用于任何大小阵列的O(n)的整体存储要求系统总共自由度。讨论了这种方法对几种有趣问题类型的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号