Abstract
With the definition of recursive relations for the reflection operator for N strips or patches, two recursive algorithms are developed, which are easily programmable, to calculate the scattering by N strips or patches. One algorithm is for arbitrary excitation while 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. Also, if the N strips or patches are identical and equally spaced, symmetry can be exploited to speed up the algorithms. A program has been developed by the authors to calculate the scattering by N strips, and the result is shown to converge to the scattering by a large strip when the N strips are touching each other.
Original language | English (US) |
---|---|
Pages (from-to) | 507-515 |
Number of pages | 9 |
Journal | IEEE Transactions on Antennas and Propagation |
Volume | 38 |
Issue number | 4 |
DOIs | |
State | Published - Apr 1990 |
Externally published | Yes |
ASJC Scopus subject areas
- Electrical and Electronic Engineering