A fast processing algorithm is developed in this paper to compute far-field patterns directly from near-field data acquired on plane-polar, bi-polar and spiral geometries. The convolution property of the radiation integral is exploited to apply the efficient Fast Fourier Transform, so avoiding the need of intermediate interpolations usually adopted to recover the plane-rectangular data format. Numerical tests on elementary dipole arrays are presented to show the effectiveness of the proposed approach.
Direct near-field to far-field transformations on strategic scanning surfaces
COSTANZO, Sandra;DI MASSA, Giuseppe
2008-01-01
Abstract
A fast processing algorithm is developed in this paper to compute far-field patterns directly from near-field data acquired on plane-polar, bi-polar and spiral geometries. The convolution property of the radiation integral is exploited to apply the efficient Fast Fourier Transform, so avoiding the need of intermediate interpolations usually adopted to recover the plane-rectangular data format. Numerical tests on elementary dipole arrays are presented to show the effectiveness of the proposed approach.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.