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 the forward-backward method using spectral acceleration for the fast analysis of large array problems
✍ Scribed by Chou, H.-T.
- Book ID
- 114455057
- Publisher
- The Institution of Electrical Engineers
- Year
- 2000
- Tongue
- English
- Weight
- 407 KB
- Volume
- 147
- Category
- Article
- ISSN
- 1350-2417
No coin nor oath required. For personal study only.
📜 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
## Abstract In this paper, a method is presented for analyzing very large finite arrays of tapered‐slot antenna elements. The Toeplitz matrix property of regularly spaced arrays, combined with a parametrically truncated coupling radius, generates fixed matrix storage based on the coupling radius ra
## 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