z-logo
Premium
Fast all modes (FAM) method combined with NMSP for evaluating spatial domain layered medium Green's functions of moderate thickness
Author(s) -
Wu Boping,
Tsang Leung,
Ong ChongJin
Publication year - 2007
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.22907
Subject(s) - gradient descent , matlab , pentium , method of steepest descent , microwave , domain (mathematical analysis) , mode (computer interface) , algorithm , wavelength , optics , plane (geometry) , computer science , mathematical analysis , topology (electrical circuits) , physics , mathematics , geometry , telecommunications , combinatorics , artificial intelligence , artificial neural network , parallel computing , operating system
An efficient and novel approach, the fast all modes (FAM) method, was developed to locate all modes precisely on the entire complex plane for a single layered media. The modes include surface wave modes, leaky wave modes, and improper modes. For the case where the layer thickness is 1 wavelength, the pre‐processing FAM requires 0.34 s for computing 500 mode locations of both TE and TM modes using a Pentium IV 3.2 GHz PC running Matlab. To justify our FAM method, we use the numerical modified steepest‐descent path (NMSP) method to evaluate spatial domain Green's functions for mixed potentials G A and G V . The NMSP method computes the steepest descent integral with all the pole proximities extracted and replaced by incomplete error functions. The CPU per distance point based on the FAM/NMSP method takes less than 6 mss for all distance ranges. All computed results are accurate to within 0.2% of the conventional half space extraction method. © 2007 Wiley Periodicals, Inc. Microwave Opt Technol Lett 49: 3112–3118, 2007; Published online in Wiley Inter‐Science (www.interscience.wiley.com). DOI 10.1002/mop.22907

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here