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


Creative Commons License

AYDIN ÇİVİ H. Ö. , ERTÜRK V. B. , Chou H.

MICROWAVE AND OPTICAL TECHNOLOGY LETTERS, vol.47, no.3, pp.293-298, 2005 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 47 Issue: 3
  • Publication Date: 2005
  • Doi Number: 10.1002/mop.21150
  • Journal Name: MICROWAVE AND OPTICAL TECHNOLOGY LETTERS
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.293-298
  • Middle East Technical University Affiliated: Yes

Abstract

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 front 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 array's with circular and/or elliptical boundaries are presented to validate the efficiency, and accuracy of this approach. (c) 2005 Wiley Periodicals, Inc.