DocumentCode
1359465
Title
Recursive algorithms for calculating the scattering from N strips or patches
Author
Gurel, Levent ; Chew, Weng Cho
Author_Institution
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
Volume
38
Issue
4
fYear
1990
fDate
4/1/1990 12:00:00 AM
Firstpage
507
Lastpage
515
Abstract
Using the definition of recursive relations for the reflection operator for N strips or patches, two easily programmable recursive algorithms are developed to calculate the electromagnetic scattering by N strips or patches. One algorithm is for arbitrary excitation, and the other is for a fixed excitation. The recursive algorithms require the inversion of small matrices at each stage and hence are suitable for programming on smaller computers. If the N strips or patches are identical and equally spaced, symmetry can be exploited to speed up the algorithms. A program was developed to calculate scattering by N strips, and the result is shown to converge to scattering by a large strip when the N strips are contiguous
Keywords
electrical engineering computing; electromagnetic wave scattering; radar cross-sections; N strips; arbitrary excitation; computer program; electromagnetic scattering; fixed excitation; patches; programmable recursive algorithms; radar cross-sections; reflection operator; Electromagnetic reflection; Electromagnetic scattering; Frequency selective surfaces; Geometry; Microwave integrated circuits; Nonhomogeneous media; Phased arrays; Physics; Resonance; Strips;
fLanguage
English
Journal_Title
Antennas and Propagation, IEEE Transactions on
Publisher
ieee
ISSN
0018-926X
Type
jour
DOI
10.1109/8.52269
Filename
52269
Link To Document