首页>
外国专利>
Reducing a parasitic graph in moment computation algorithms in VLSI systems
Reducing a parasitic graph in moment computation algorithms in VLSI systems
展开▼
机译:在VLSI系统的矩计算算法中减少寄生图
展开▼
页面导航
摘要
著录项
相似文献
摘要
An improved method for interconnect delay analysis for VLSI circuits reduces a parasitic graph for moment computation by eliminating one or more nodes in the graph. The elimination process is performed based upon the degree of the nodes. By eliminating nodes in this fashion, the computation complexity is significantly reduced. With this elimination process, resistor loops and crossed loops can also be solved. The order in which the nodes are eliminated is optimized using the depth-first-search method on the parasitic graphs, further reducing the computation complexity. The method provides a consistent functional interface, applicable to different circuit model structures. In addition, the method accounts for coupling capacitance between interconnects.
展开▼