Comparison of precorrected FFT/adaptive integral method matching schemes
Author(s) -
Yang Kai,
Yilmaz Ali E.
Publication year - 2011
Publication title -
microwave and optical technology letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.304
H-Index - 76
eISSN - 1098-2760
pISSN - 0895-2477
DOI - 10.1002/mop.26006
Subject(s) - matching (statistics) , moment (physics) , fast fourier transform , preprocessor , grid , microwave , computer science , field (mathematics) , algorithm , method of moments (probability theory) , measure (data warehouse) , electronic engineering , mathematics , engineering , telecommunications , physics , geometry , artificial intelligence , statistics , classical mechanics , estimator , pure mathematics , database
Abstract This article presents a detailed comparison of the moment, near‐field, and far‐field matching schemes that are used in precorrected FFT/adaptive integral method solvers to anterpolate currents (interpolate fields) on the nonuniform mesh of a structure of interest in terms of sources (observers) on an auxiliary regular grid. A general error measure is developed to evaluate the matching schemes in free space or layered media and for the high‐ or low‐frequency regime of operation. It is shown that moment matching is the most robust scheme, that far‐field matching is the most accurate scheme for high‐frequency regime but breaks down for low‐frequency regime, and that near‐field matching is more accurate than moment matching but requires the most preprocessing operations. © 2011 Wiley Periodicals, Inc. Microwave Opt Technol Lett 53:1368–1372, 2011; View this article online at wileyonlinelibrary.com. DOI 10.1002/mop.26006