Decomposition of a finite-by-infinite array using two approximate semi-infinite arrays

Craeye, Christophe
(2002) Proceedings of 12th International Symposium on Antennas - Journees Internationales de Nice sur les Antennes — Location: Nice, France (12.November.2002)

Files

No attached file found for this publication.

Details

Authors
Abstract
The simulation of finite-by-infinite antenna arrays provides insight into the effects of array truncation. The exact solution to such a problem can be seen as the superposition of the infinite array and two approximate semiinfinite array (APSIA) solutions. The APSIA problem can be computed in a recursive way for arrays of increasing sizes. A fast single-sweep approximation for the APSIA problem is developed and the results are compared to the exact solution in the case of an array of tapered-slot antennas. The recursive approach automatically yields the solutions for all finite arrays of smaller sizes.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Craeye, C. (2002). Decomposition of a finite-by-infinite array using two approximate semi-infinite arrays. Journees Internationales de Nice sur les Antennes (InternationalSymposium on Antennas), Vol. 2, p. V2-351-V2-V2-4. https://hdl.handle.net/2078.5/230661