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

Civi Özlem Aydin | Zendy; Ertürk Vakur B. | Zendy; Chou HsiTseng | Zendy

Premium

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

Author(s) -

Civi Özlem Aydin,

Ertürk Vakur B.,

Chou HsiTseng

Publication year - 2005

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.21150

Subject(s) - planar , algorithm , fast fourier transform , microwave , extension (predicate logic) , computational complexity theory , fourier transform , finite element method , acceleration , discrete fourier transform (general) , computer science , computational science , mathematics , physics , fourier analysis , mathematical analysis , telecommunications , short time fourier transform , computer graphics (images) , classical mechanics , programming language , thermodynamics

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. © 2005 Wiley Periodicals, Inc. Microwave Opt Technol Lett 47: 293–298, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.21150

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research