Extension of forward‐backward method with a DFT‐based acceleration algorithm for efficient analysis of radiation/scattering from large finite‐printed dipole arrays | Zendy

Çivi Özlem Aydın | Zendy

Premium

Extension of forward‐backward method with a DFT‐based acceleration algorithm for efficient analysis of radiation/scattering from large finite‐printed dipole arrays

Author(s) -

Çivi Özlem Aydın

Publication year - 2003

Publication title -

microwave and optical technology letters

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.304

H-Index - 76

eISSN - 1098-2760

pISSN - 0895-2477

DOI - 10.1002/mop.10813

Subject(s) - dipole , acceleration , planar , fast fourier transform , dielectric , microwave , scattering , fourier transform , algorithm , radiation , computer science , mathematics , physics , computational physics , optics , engineering , electrical engineering , mathematical analysis , telecommunications , quantum mechanics , computer graphics (images)

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

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research