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

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

Full description

Saved in:
Bibliographic Details
Published inMicrowave and optical technology letters Vol. 47; no. 3; pp. 293 - 298
Main Authors Civi, Özlem Aydin, Ertürk, Vakur B., Chou, Hsi-Tseng
Format Journal Article
LanguageEnglish
Published Hoboken Wiley Subscription Services, Inc., A Wiley Company 05.11.2005
Subjects
discrete Fourier transform
iterative solvers
method of moments
phased arrays
Online AccessGet full text

Cover

More Information
Summary: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(Ntot) (Ntot 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
Bibliography:ark:/67375/WNG-L1HG5RCB-3
ArticleID:MOP21150
istex:63D2F7A55C9650EA639350BBB2CD549C0050FBD5
ISSN:0895-2477
1098-2760
DOI:10.1002/mop.21150