Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Microwave Theory and Techniques
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
