On Automatic Analysis of Geometrically Proximate Nets in VLSI Layout
نویسندگان
چکیده
We address the problem of automatic analysis of geometrically proximate nets in VLSI layout by presenting a framework (named FASCL) which supports pairwise analysis of nets based on a geometric kernel. The exact form of the analysis function can be specified to the kernel, which assumes a coupling function based on pairwise interaction between geometrically proximate nets. The user can also attach these functions to conditions and FASCL will automatically apply the function to all pairs of nets which satisfy a condition. Our method runs with sub-quadratic time complexity, O N1 k , where N is the number of nets and we have proved that k 1. We have successfully used the program to analyze circuits for bridging faults, coupling capacitance extraction, crosstalk analysis, signal integrity analysis and delay fault testing.
منابع مشابه
Notes on Channel Routing with Knock-Knees
In VLSI layout of interconnection networks, routing two-point nets in some restricted area is one of the central operations. It aims usually to minimize the layout area. Here, we consider connecting (with knock-knees) sets of N inputs and N outputs on the opposite sides of a rectangular channel, where the output order is a given permutation of the order of corresponding inputs. Such channels ar...
متن کاملOn the Characterization of Multi-Point Nets in Electronic Designs
Important layout properties of electronic designs include interconnection length values, clock speed, area requirements, and power dissipation. A reliable estimation of those properties is essential for improving placement and routing techniques for digital circuits. Previous work on estimating design properties failed to take multi-point nets into account. All nets were assumed to be 2-point n...
متن کاملA speed-oriented, fully-automatic layout program for random logic VLSI devices
This paper describes a low cost, quick turnaround capability for generating high performance, random logic LSI and VLSI devices using the Standard Cell approach. This standard cell approach, described below, utilizes a fully automatic layout capability that automatically maximizes the speed of logic paths identified by the user as critical. In spite of the sophistication and size of the automat...
متن کاملMulti-way partitioning of VLSI circuits
Partitioning is one of the critical phases of hierarchical design processes like VLSI design. Good partitioning techniques can positively in uence the performance and cost of a VLSI product. This paper proposes a partitioning algorithm with a new cost metric. Viewed from a VLSI layout point of view our cost metric minimizes the average delay per net. It can also be interpreted as achieving the ...
متن کاملThe Efficient Hybrid Approach to Channel Routing Problem
Known as an NP-Complete problem, the channel routing problem is very important in the automatic layout design of VLSI circuit and printed circuit boards. A distributed hybrid algorithm for this channel routing problem is presented in MPI environments. This system is implemented on a network of personal computers running Linux operating system connected via 100Mbps Ethernet. Each slave processor...
متن کامل