A ROBUST NUMERICAL POLE-EXTRACTION ALGORITHM FOR STRATIFIED MEDIUM

Y .C. Pan
Logic Technology Development Microprocessor Design Group Intel Corporation Hillsboro, OR 971246461, USA
W. C. Chew

christopher.pan@inteI.com
1. INTRODUCTION

Center for Computational Electromagnetics Department of Electrical and Computer Engineering University oflllinois L 61801-2991, USA Urbana, I w-chew@uiuc.edu

Recent advances in VLSI technology heighten the need to accurately characterize on-chip threedimensional (3-D) complex interconnect shuchms embedded in a layered dielectric medium. Fast evaluation of the multilayer Greens function is often the key in developing & integral equation based algorithm to tackle this problem [I, 21. Some of the existing pole extraction algorithms, such as (31, are geometty dependent. In this paper, we present a refined pole extraction algorithm that was first conceived in [2] for finding poles in a general stratified medium at an arbitrary frequency. 2. THEORETICAL BACKGROUND The electromagneticfield radiated by a dipole J(r,r)=$JJ(r-r) given by pointing in an arbitrary direction fl is

(2.4)

Letting k, = k,?

+ k.$, the spherical wave can be expanded using Weyl identity

where SIP is the Sommerfeld integral path andHfIis the zeroth order Hankel function of the first kind. When the scatterer is embedded in a layered medium, the E and FI fields can be represented in terms of Sommerfeld integrals of form ~dk,k,fl~(k,,,k, &)(k+,lp
w

- pl)e*--*l

(2.6)

where!$(kP,kz)

is the weighting function for one of the four image groups, IG, written in tenns of

generalized reflection and transmission coefficient. In Equation (2.6), ! 3 is either transverse electrical (TE) or transverse magnetic (TM), and IM is the location of the first image of image group IG. Direct evaluation of Equation (2.6) is very inefficient. This is because the SIP extends from k,,=-m to m and the integrand decays slowly away from k+. The integral can be evaluated much faster if the and then add residue contributions from contributing integration is done on a steepest descent path (SDP) poles on the complex kpplane. The derivation of SDPs for evaluating the integral in Equation (2.6) can be found in [2] and [6]. In this paper, the focus is on developing an efficient algorithm for finding the contributing poles on the complex kp plane and evaluating their residues. 3. A GENERAL POLE SEARCHING ALGORITHM It may be possible to derive analytical expressions for the pole locations and residues for very simple shuctures such as parallel plates. In general, however, such analytical solutions are difficult, if not impossible, to derive. In [2], a systematicpole-semching algorithm was developed to find the poles and the associated residues for a general layered medium. This algorithm is based on Cauchy theorem [SI,which states that if C is a positively oriented simple closed contour within and on which a functionfis analytic except for a finite number of singular points zb k=J, 2, ._., n, then

0-7803-667-1/04/$20~00 0 2004 IEEE

321

At the SM of the algorithm, a contour integration is performed around a given rectangle on the complex kp plane. For clarity, we will call this a level 0 box. If the result is zero, then no singularity is present inside this rectangle. If the result is nonzero, the rectangle is subdivided into four finer level-I child boxes. A contour integration is performed around each of these finer rectangles. Of these level-I boxes, only those with nontrivial residues are further divided. The algorithm recursively subdivides boxes with nontrivial residues until a set level, at which point a complex root-searching routine is called to find the exact location ofthe poles. An important by-product of this algorithm is the residue of a pole, which equals the value of the contour integral around the fmest-level boxes that contain it.

One enhancement was made to the aforementioned algorithm in its treatment of branch-cut singularity.The need for this refinement arises if a contour integral is performed around a box with a branch-cut singularity. Without special treatment the algorithm would take the box as one with a pole present. Subdividing this box will only make matters worse, as each of the finer-level boxes with the branch-cut will also be treated as boxes with poles. In Figure I, the green circles are the location of the poles found. The left plot shows literally thousands of poles found along the branch cut. In a layered medium, the branch points are always associated with the outermost layers of the layered medium [6]. This is because the branch points are physically associated with lateral waves, and lateral waves exist only in an unbounded region. There are, therefore, at most two branch-cuts on the complex kp plane. The locations of the poles are invariant on the complex kp plane. The physical interpretation of the invariance of the pole locations is that the poles are the guided modes of the layered medium. Mathematically, this fact can be shown by noting that the denominator of the image weighting functions is zero at a pole. By setting the denominator of the image weighting functions of layer n-1 to zero, where n=I. 2, ..., N,we have
I

1-

R " . ,

e%.k%d ".I .-I

I

-0

Solving for

im,n+te*=l'.

,we have

The denominator of the image weighting functions of layer n is

im,n+,e'-2'., which is also zero when ifl,n+,e"-z'. = i/in,"-,. It can be shown by induction that the poles on the complex
k,, plane are invariant in all layers. Because of this fact, if we transform to the complex 0 plane using relations kp=k,, sin8 and k=k,,cos@,and perform the pole-searching routine in one of the two unbounded regions, then there is at most one branch-cut, which is associated with the other unbounded region. Hence, it is apparent that this enhancement is specific to the case when there are two unbounded regions. In a Sommerfeld integral, the Im {kJ>O branch-cut is used to ensure the radiation condition. Figure 2 shows the situation where this branch cut intersects the rectangle on which the contour integration is performed. The contour integral is nontrivial even if the enclosed area does not contain a pole. If, instead of honoring the radiation condition and changing the value of the integrand discontinuously as we cross the branch cut, we integrate'by enforcing the Re (kJ>O condition, as shown in the left plot of Figure 2 the integrand will be continuous across the I m {kJ=O branch cut. The effect of this closed-contour integration is that half of the area enclosed by the rectangle, e.g., the left half, is on the top Im (kJ=O Riemann sheet, and the other half, the right half, is on the bottom I m {k,)=O Riemann sheet. The integral, however, will no longer encounter the Im (kJ=O branch-cut singularity, and a nonkivial integration would only indicate there are poles in the enclosed area. This integral is repeated by enforcing the Re (kJ CO condition as shown in the right plot of Figure 2. In this case the left half of the enclosed area is on the bottom Im (kJ=O

1-ii

322

Riemann sheet, while the right half is on the top Im {kJ=O Riemann sheet. By doing these two contour integrals, a rectangle is kept only if the enclosed area contains poles on the top Im {kJ =O Riemann sheet, poles on the bottom I m (kJ=O Riemann sheet, and the branch point.

. , ......... !

n*

8,

. ................... D P <,e A. .').

.I .In

.%.S

J.."

111

....
% * '

e . .

. . . .".*

A*

.I

Figure 1 Complex 0 plane contour plots around a pole show a need for better treatment of the branch-cut. The circles mark the locations of the poles found by the polesearching algorithm. The left plot shows the locations found by the original algorithm. The right plot shows the locations found by the newly enhanced algorithm. The position of the branch point is known, so eliminating it is simple. Whether a pole is on top or bottom of the I m &J=O Riemann sheets can be decided by simply evaluating the integrand at the pole. The result of this refinement to the pole-searching algorithm is shown in the right plot of Figure 1, where only the pole and the branch point are found.
Sc$*&.~
-0dlCfl

B*%c.l)cIIJ- 0r::rr

-4.

te4 &

-c

?dew*l.pJ&Cti-bmtn

Figure 2 The top and the bottom Re {kJ = 0 Riemann sheets. The dashed lines are the I m (kJ = 0 branch cut. NUMERICAL RESULTS

A structure with five dielectric layers, shown in Figure 3, is used to verify the new multilayer Green's
function. First, the pole-searching routine is tested when the medium is bounded below by a ground plane. Next, the ground plane is removed, so the medium is unbounded. The results are shown in Figure 4. The results are superimposed on Madah@ contour plots. 5. CONCLUSION In this paper, we presented a refined pole extraction algorithm first proposed in [Z]. The algorithm is robust and can extract all the poles in a given region of the complex kp plane.

323

REFERENCE [I] J. S. Zhao, W. C. Chew, C. C. Lu, E. Michielssen, and J. M. Song, Thin-stratified medium fast multipole algorithm for solving microship smchues, IEEE Trans. Microwave Theory Tech., vol. 46, pp. 395403, Apr. 1998. [2] B.Hu,W. C. Chew, E. Michielssen, and J. S. Zhao, Fast inhomogeneous plane wave algorithm for the fast analysis of two-dimensional scattering problems, Radio Science, vol. 34, pp. 159-172, July 1999. [3] Y. Wang, b. L. Ooi, and M. S. Leong, An efficient and fast approach for surface-wave pole extraction in two-layered microstrip geometry, Microwave and Optical Tech. Letters, Vol. 41, pp. 253-258, May 2004. [4] Y.C. Pan, Development of the fast multipole method for stratified medium, PhD thesis, University of Illinois at Urbana-Champaign, 2002. [5] R. V. Churchill and J. W. Brown, Complex Variables ond Applicotions, 5th ed., New York McGrawHill, 1990. [6] W. C. Chew, Wave and Fields in Inhomogeneous Media, New York Van Nostrand Reinhold, 1990.

Figure 4 The location of the poles on the complex 0lu plane for a five-layer stratified medium. Blue circles mark the locations calculated by the pole-searching algorithm. The plot on the right is for the structure with a ground plane below; the one on the left is for the structure without ground planes.

324