𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extension of forward-backward method with DFT-based acceleration algorithm for the efficient analysis of large periodic arrays with arbitrary boundaries

✍ Scribed by Özlem Aydin Civi; Vakur B. Ertürk; Hsi-Tseng Chou

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
467 KB
Volume
47
Category
Article
ISSN
0895-2477

No coin nor oath required. For personal study only.

✦ Synopsis

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 boundaries. Both the computational complexity and storage requirements of this approach are O(N tot ) (N tot is the total number of unknowns). The numerical results for both printed and freestanding dipole arrays with circular and/or elliptical boundaries are presented to validate the efficiency and accuracy of this approach.

📜 SIMILAR VOLUMES

Extension of forward-backward method wit
Extension of forward-backward method with a DFT-based acceleration algorithm for efficient analysis of radiation/scattering from large finite-printed dipole arrays
✍ Özlem Aydın Çivi 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 473 KB

## 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

Efficient analysis of large phased array
Efficient analysis of large phased arrays using iterative MoM with DFT-based acceleration algorithm
✍ V. B. Ertürk; Hsi-Tseng Chou 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 267 KB

## 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__~__

The forward–backward method with a novel
The forward–backward method with a novel spectral acceleration algorithm (FB/NSA) for the computation of scattering from two-dimensional large-scale impedance random rough surfaces
✍ D. Torrungrueng; Joel T. Johnson 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## 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