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

Files

Extension of forward backward method with DFT based acceleration algorithm for the efficient analysis of large periodic arrays with arbitrary boundaries.pdf (208.73 KB)

Date

2003

Authors

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

Source Title

Proceedings of the Antennas and Propagation Society International Symposium, IEEE 2003

Print ISSN

0272-4693

Electronic ISSN

Publisher

IEEE

Volume

Issue

Pages

31 - 34

Language

English

Type

Conference Paper

Journal Title

Journal ISSN

Volume Title

Series

Abstract

An extension of Forward-Backward (FB) with Discrete Fourier Transform (DFT) based acceleration approach is presented. This is given to provide a relatively efficient analysis of EM radiation/scattering from an electrically large, planar, periodic, finite arrays with arbitrary boundaries, such as arrays with circular or elliptical boundaries. It is shown that only very few significant DFT terms are sufficient to provide accurate results.

Course

Other identifiers

Book Title

Keywords

Computational complexity , Directional patterns (antenna) , Discrete fourier transforms , Electromagnetic wave scattering , Matrix algebra , Method of moments , Numerical methods , Radiation , Electromagnetic wave radiation , Forward backward , Antenna arrays

Citation

Permalink

http://hdl.handle.net/11693/27526

item.page.isversionof

https://doi.org/10.1109/APS.2003.1220113

Collections

Department of Electrical and Electronics Engineering