Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

A sparse-matrix/canonical grid method for analyzing densely packed interconnects

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Li, S.-Q. ; Dept. of Electron. Eng, City Univ. of Hong Kong, Hong Kong ; Yu, Y. ; Chi Hou Chan ; Chan, K.F.
more authors

In this paper, a fast numerical method called the sparse-matrix/canonical-grid (SM/CG) method is employed to analyze densely packed microstrip interconnects that involve a large number of unknowns. The mixed-potential integral equation is solved by using the method of moments in the spatial domain. The closed-form expressions of the spatial Green's functions of microstrip structures are obtained from the combination of the fast Hankel transform and the matrix pencil method. The Rao-Wilton-Glisson triangular basis functions are used to convert the integral equation into a matrix equation. The matrix equation is then solved by using the SM/CG method, in which the far-interaction portion of the matrix-vector multiplication in the iterative solution is performed by the fast Fourier transforms (FFTs). This is achieved by the Taylor series expansions of the spatial Green's functions about the uniformly spaced canonical grid points overlaying the triangular discretization. Numerical examples are presented to illustrate the accuracy and efficiency of the proposed method. The SM/CG method has computational complexity of O(NlogN). Furthermore, being FFT-based facilitates the implementation for parallel computation

Published in:

Microwave Theory and Techniques, IEEE Transactions on  (Volume:49 ,  Issue: 7 )