Cart (Loading....) | Create Account
Close category search window

An efficient algorithm for generation of loop-tree basis in 2.5D interconnect models

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

1 Author(s)
Okhmatovski, V.I. ; Dept. of Electr. & Comput. Eng., Manitoba Univ., Winnipeg, Man., Canada

An efficient algorithm for obtaining the loop-tree decomposition of the method of moment (MoM) basis is proposed. The set of loops consists of two parts - the small loops formed around the vertices of the MoM mesh and the superloops generated as a result of sequential addition of via connections to the interconnect model. The process of forming the superloops involves NV-steps, NVbeing the number of vias in the interconnect model. The method is based on repetitive execution of well-known tree generation algorithm and the shortest path search algorithm. Both of these algorithms scale as O(N), where N is the size of MoM mesh, resulting in O(NV N) total complexity of the proposed loop generation process.

Published in:

Electrical Performance of Electronic Packaging, 2005. IEEE 14th Topical Meeting on

Date of Conference:

24-26 Oct. 2005

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.