Recursive Algorithms for Calculating the Scattering from N Strips or Patches

Levent Gurel, Weng Cho Chew

Research output: Contribution to journalArticlepeer-review

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 languageEnglish (US)
Pages (from-to)507-515
Number of pages9
JournalIEEE Transactions on Antennas and Propagation
Volume38
Issue number4
DOIs
StatePublished - Apr 1990

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Recursive Algorithms for Calculating the Scattering from N Strips or Patches'. Together they form a unique fingerprint.

Cite this