z-logo
Premium
Radial propagation and steepest descent path integral representations of the planar microstrip dyadic Green's function
Author(s) -
Barkeshli S.,
Pathak P. H.
Publication year - 1990
Publication title -
radio science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.371
H-Index - 84
eISSN - 1944-799X
pISSN - 0048-6604
DOI - 10.1029/rs025i002p00161
Subject(s) - method of steepest descent , microstrip , mathematics , mathematical analysis , gradient descent , boundary (topology) , representation (politics) , methods of contour integration , planar , function (biology) , integral equation , convergence (economics) , green's function , moment (physics) , method of moments (probability theory) , geometry , topology (electrical circuits) , physics , optics , computer science , classical mechanics , computer graphics (images) , biology , evolutionary biology , artificial neural network , estimator , law , economic growth , machine learning , political science , statistics , combinatorics , politics , economics
A radial propagation integral representation of the microstrip electric dyadic surface Green's function is developed. This representation is very efficient for a numerical evaluation of the field when the source and observation points are laterally rather than vertically separated with respect to the plane of the substrate. Furthermore, when the integration contour is deformed to the steepest descent path, the Green's function exhibits an even faster convergence. In contrast, the conventional Sommerfeld integral representation of the microstrip Green's function converges very poorly for this case. Numerical examples are presented which indicate that the representations obtained here are surprisingly efficient even for relatively small lateral separation of the source and field points. This work is especially useful in the moment method analysis of microstrip antenna arrays where the mutual coupling effects are important.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here