An extension of the discrete Fourier transform (DFT)based forward-backward algorithm is developed using the virtual-element approach to provide a fast and accurate analysis of electromagnetic radiation/scattering from electrically large, planar, periodic, finite (phased) arrays with arbitrary bounda
Efficient analysis of large phased arrays using iterative MoM with DFT-based acceleration algorithm
✍ Scribed by V. B. Ertürk; Hsi-Tseng Chou
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 267 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0895-2477
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
A discrete Fourier transform (DFT)‐based iterative method of moments (IMoM) algorithm is developed to provide an O(N~tot~) computational complexity and memory storages for the efficient analysis of electromagnetic radiation/scattering from large phased arrays. Here, N~tot~ is the total number of unknowns. Numerical results for both printed and free‐standing dipole arrays are presented to validate the algorithm's efficiency and accuracy. © 2003 Wiley Periodicals, Inc. Microwave Opt Technol Lett 39: 89–94, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.11136
📜 SIMILAR VOLUMES
## Abstract A discrete‐Fourier‐transform (DFT) based forward‐backward (FB) algorithm has been developed for the fast and accurate analysis of electrically large freestanding dipole arrays [1]. In this paper, an extension of the FB method (FBM) with a DFT‐based acceleration approach is presented to