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
Extension of forward-backward method with a DFT-based acceleration algorithm for efficient analysis of radiation/scattering from large finite-printed dipole arrays
✍ Scribed by Özlem Aydın Çivi
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 473 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0895-2477
No coin nor oath required. For personal study only.
✦ Synopsis
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 provide a relatively efficient analysis of EM radiation/scattering from an electrically large, planar, periodic, finite dipole array printed on a grounded dielectric substrate. Computational complexity of this new approach is O(N~tot~), where N~tot~ is the number of unknowns. Numerical results are presented to validate the efficiency and accuracy of the method. © 2003 Wiley Periodicals, Inc. Microwave Opt Technol Lett 37: 20–26, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.10813
📜 SIMILAR VOLUMES
## Abstract The forward–backward method with a novel spectral acceleration algorithm (FB/NSA) has been shown to be a very efficient 𝒪(__N__~tot~) iterative method of moments, where __N__~tot~ is the total number of unknowns to be solved, for the computation of electromagnetic wave scattering from t