TY - JOUR
T1 - Multilevel surface decomposition algorithm for rapid evaluation of transient near-field to far-field transforms
AU - Shlivinski, Amir
AU - Boag, Amir
N1 - Funding Information:
Manuscript received March 23, 2008; revised June 29, 2008. Current version published March 04, 2009. This research was supported by The Israel Science Foundation under Grant 745/07. A. Shlivinski is with the Department of Electrical and Computer Engineering, Faculty of Engineering Science, Ben-Gurion University of the Negev, Beer Sheva 84105, Israel (e-mail: [email protected]). A. Boag is with the School of Electrical Engineering, Tel Aviv University, Tel Aviv 69978, Israel (e-mail: [email protected]). Color versions of one or more of the figures in this paper are available online at http://ieeexplore.ieee.org. Digital Object Identifier 10.1109/TAP.2008.2009730
PY - 2009/4/1
Y1 - 2009/4/1
N2 - A fast multilevel algorithm with reduced memory requirements for the evaluation of transient near-field to far-field transforms is presented. The computational scheme is based on a hierarchical decomposition of an arbitrary shaped enclosing surface over which the near-fields of an antenna or a scatterer are given. For surface subdomains at the highest decomposition level, the angular-temporal far-field patterns are calculated directly from the known near fields over a sparse angular grid of directions and a short temporal duration. The multilevel computation comprises angular and temporal interpolations thus increasing angular resolution and temporal duration of radiation patterns while aggregating the subdomain contributions between successive decomposition levels. These steps are repeated until obtaining the transient far-field response of the whole enclosing surface. The computational complexity of the proposed algorithm is substantially lower than that of the direct evaluation. Reduction in memory requirements is obtained by formulating the algorithm as a marching-on-in-time windowed scheme. This approach allows for embedding of the accelerated transforms within existing near-field modeling tools.
AB - A fast multilevel algorithm with reduced memory requirements for the evaluation of transient near-field to far-field transforms is presented. The computational scheme is based on a hierarchical decomposition of an arbitrary shaped enclosing surface over which the near-fields of an antenna or a scatterer are given. For surface subdomains at the highest decomposition level, the angular-temporal far-field patterns are calculated directly from the known near fields over a sparse angular grid of directions and a short temporal duration. The multilevel computation comprises angular and temporal interpolations thus increasing angular resolution and temporal duration of radiation patterns while aggregating the subdomain contributions between successive decomposition levels. These steps are repeated until obtaining the transient far-field response of the whole enclosing surface. The computational complexity of the proposed algorithm is substantially lower than that of the direct evaluation. Reduction in memory requirements is obtained by formulating the algorithm as a marching-on-in-time windowed scheme. This approach allows for embedding of the accelerated transforms within existing near-field modeling tools.
KW - Antenna transient analysis
KW - Computation time
KW - Finite-difference (FD) methods
KW - Finite-volume (FV) methods
KW - Near-field far-field (NF-FF) transformation
UR - http://www.scopus.com/inward/record.url?scp=63149162301&partnerID=8YFLogxK
U2 - 10.1109/TAP.2008.2009730
DO - 10.1109/TAP.2008.2009730
M3 - Article
AN - SCOPUS:63149162301
SN - 0018-926X
VL - 57
SP - 188
EP - 195
JO - IEEE Transactions on Antennas and Propagation
JF - IEEE Transactions on Antennas and Propagation
IS - 1
ER -