Patent US20030195736A1 successfully refreshed from Google Patents.
US20030195736A1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of storing cross-hierarchy coupling data in a hierarchical circuit model
Assignee: Sun Microsystems Inc
•
Filing: 2002-04-11
•
Granted: —
•
Expires: 2022-04-11
Abstract
Abstract Data clusters are added between functional blocks in a higher-level hierarchical circuit model. The data clusters account for inter-level parasitic values without flattening the circuit model to a lower hierarchical level and operate as an information graph or network between nodes, which can be used with the standard, or default, information graph between nodes. The data clusters also allow the use of standard functional blocks without introducing artificial nodes into the circuit at a lower level that could create a coupling point at a higher level. The use of data clusters allows rapid and accurate modeling of the circuit without flattening the circuit to the lowest level.
Inventors
- 👤 Pradiptya Ghosh
- 👤 Robert Walsh
- 👤 Tuan Doan
- 👤 Jean Hassoun
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 02:41
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; G06F30/36; G06F30/367
Claims Analysis
Total Claims: 25
Claim 1
Independent Claim
108 words
1 . A cluster graph stored in a computer-readable medium for use in a simulation of an integrated circuit on a computer-aided-design (“CAD”) tool, the cluster graph comprising: data; a first node designation; and a second node designation, the first node designation representing a first node at a first level of hierarchy and the second node designation representing a second node at a second level of hierarchy, the second node designation being an artificial node at the first level of hierarchy, the second level of hierarchy being higher than the first level of hierarchy, and the data representing inter-level coupling between the first node and the second node.
Claim 2
Dependent Claim
108 words
1 . A cluster graph stored in a computer-readable medium for use in a simulation of an integrated circuit on a computer-aided-design (“CAD”) tool, the cluster graph comprising: data; a first node designation; and a second node designation, the first node designation representing a first node at a first level of hierarchy and the second node designation representing a second node at a second level of hierarchy, the second node designation being an artificial node at the first level of hierarchy, the second level of hierarchy being higher than the first level of hierarchy, and the data representing inter-level coupling between the first node and the second node.
Claim 3
Dependent Claim
22 words
2 . The cluster graph of claim I wherein the data representing inter-level coupling of the integrated circuit comprises a resistor-capacitor tree.
Claim 4
Dependent Claim
28 words
3 . The cluster graph of claim 1 wherein the first level of hierarchy is a gate level and the second level of hierarchy is a top level.
Claim 5
Dependent Claim
96 words
4 . A cluster graph stored in a computer-readable medium for use in a simulation of an integrated circuit on a computer-aided-design (“CAD”) tool, the cluster graph comprising: data; a first node designation; and a second node designation, the first node designation representing a first node at a gate level of hierarchy and the second node designation representing a second node at a top level of hierarchy, the second node designation being an artificial node at the gate level of hierarchy, and the data representing a resistor-capacitor tree between the first node and the second node.
Claim 6
Dependent Claim
96 words
4 . A cluster graph stored in a computer-readable medium for use in a simulation of an integrated circuit on a computer-aided-design (“CAD”) tool, the cluster graph comprising: data; a first node designation; and a second node designation, the first node designation representing a first node at a gate level of hierarchy and the second node designation representing a second node at a top level of hierarchy, the second node designation being an artificial node at the gate level of hierarchy, and the data representing a resistor-capacitor tree between the first node and the second node.
Claim 7
Dependent Claim
112 words
5 . An integrated electronic circuit model stored on a computer-readable medium, the integrated electronic circuit model comprising: a view of an object having a first node at a first level of hierarchy; a base cluster of the object at the first level of hierarchy; and an inter-level cluster of the object between the first node at the first level of hierarchy and an artificial node at the first level of hierarchy, the artificial node corresponding to a second node at a second level of hierarchy, the second level of hierarchy being higher than the first level of hierarchy, wherein the electronic circuit model overlaps the base cluster with the inter-level cluster.
Claim 8
Dependent Claim
112 words
5 . An integrated electronic circuit model stored on a computer-readable medium, the integrated electronic circuit model comprising: a view of an object having a first node at a first level of hierarchy; a base cluster of the object at the first level of hierarchy; and an inter-level cluster of the object between the first node at the first level of hierarchy and an artificial node at the first level of hierarchy, the artificial node corresponding to a second node at a second level of hierarchy, the second level of hierarchy being higher than the first level of hierarchy, wherein the electronic circuit model overlaps the base cluster with the inter-level cluster.
Claim 9
Dependent Claim
18 words
6 . The integrated electronic circuit model of claim 5 wherein the inter-level cluster is a resistor-capacitor tree.
Claim 10
Dependent Claim
22 words
7 . The integrated electronic circuit model of claim 5 wherein the first level of hierarchy is above a transistor-level of hierarchy.
Claim 11
Dependent Claim
25 words
8 . The integrated electronic circuit model of claim 5 wherein the base cluster is extracted from flattened data of the integrated electronic circuit model.
Claim 12
Dependent Claim
79 words
9 . The integrated electronic circuit model of claim 5 further comprising a second instance of the object at the first level of hierarchy, the second instance of the object being represented by the view and the base cluster; and a second inter-level cluster at the first level of hierarchy having inter-level coupling data between a third node of the second instance of the object and a fourth node, the forth node being on a third level of hierarchy.
Claim 13
Dependent Claim
22 words
10 . The integrated electronic circuit model of claim 9 wherein the third level of hierarchy is the second level of hierarchy.
Claim 14
Dependent Claim
25 words
11 . The integrated electronic circuit model of claim 9 wherein the data in the second inter-level cluster is the data in the inter-level cluster.
Claim 15
Dependent Claim
21 words
12 . The integrated circuit model of claim 9 wherein the first level of hierarchy is a gate level of hierarchy.
Claim 16
Dependent Claim
193 words
13 . An integrated electronic circuit model stored on a computer-readable medium, the integrated electronic circuit model comprising: a first instance of an object at a gate level of hierarchy of the integrated electronic circuit model, the object being represented by a view and a base cluster; a second instance of the object at the gate level of hierarchy; a first inter-level cluster of the first instance of the object between a first node of the first instance and a first artificial node, the first artificial node corresponding to a first higher-level node at a second level of hierarchy, the second level of hierarchy being higher than the first level of hierarchy; and a second inter-level cluster of the second instance of the object between a second node of the second instance and a second artificial node, the second artificial node corresponding to a second higher-level node at the second level of hierarchy, wherein the electronic circuit model overlaps the base cluster with the first inter-level cluster to model the first instance of the object and overlaps the base cluster with the second inter-level cluster to model the second instance of the object.
Claim 17
Dependent Claim
193 words
13 . An integrated electronic circuit model stored on a computer-readable medium, the integrated electronic circuit model comprising: a first instance of an object at a gate level of hierarchy of the integrated electronic circuit model, the object being represented by a view and a base cluster; a second instance of the object at the gate level of hierarchy; a first inter-level cluster of the first instance of the object between a first node of the first instance and a first artificial node, the first artificial node corresponding to a first higher-level node at a second level of hierarchy, the second level of hierarchy being higher than the first level of hierarchy; and a second inter-level cluster of the second instance of the object between a second node of the second instance and a second artificial node, the second artificial node corresponding to a second higher-level node at the second level of hierarchy, wherein the electronic circuit model overlaps the base cluster with the first inter-level cluster to model the first instance of the object and overlaps the base cluster with the second inter-level cluster to model the second instance of the object.
Claim 18
Dependent Claim
107 words
14 . A method of creating an inter-level cluster graph for simulating inter-level coupling in an hierarchical integrated electronic circuit model on a computer-aided-design (“CAD”) tool, the method comprising: starting an extractor application of the CAD tool; generating a flattened data model generating an object at a first level of hierarchy from the flattened data model, the object being represented by a view and a base cluster graph; entering inter-level coupling data between a node of the object and a second node at a second level of hierarchy into the inter-level cluster graph; and linking the first node to the second node in the inter-level cluster graph.
Claim 19
Dependent Claim
107 words
14 . A method of creating an inter-level cluster graph for simulating inter-level coupling in an hierarchical integrated electronic circuit model on a computer-aided-design (“CAD”) tool, the method comprising: starting an extractor application of the CAD tool; generating a flattened data model generating an object at a first level of hierarchy from the flattened data model, the object being represented by a view and a base cluster graph; entering inter-level coupling data between a node of the object and a second node at a second level of hierarchy into the inter-level cluster graph; and linking the first node to the second node in the inter-level cluster graph.
Claim 20
Dependent Claim
20 words
15 . The method of claim 14 A-herein in the first level of hierarchy is higher than a transistor level.
Claim 21
Dependent Claim
16 words
16 . The method of claim 14 wherein the inter-level cluster graph is a resistor-capacitor tree.
Claim 22
Dependent Claim
95 words
17 . A method of modeling an integrated circuit on a computer system, the method comprising: starting a CAD tool on the computer system; loading a hierarchical circuit model into the CAD tool; running a non-flattened simulation of the integrated circuit at a first level of hierarchy with the CAD tool on the computer system, the simulation including an object with a node, by overlapping an inter-level cluster graph containing coupling data between the node and a second node, the second node being at a second level, with a base cluster graph of the object.
Claim 23
Dependent Claim
95 words
17 . A method of modeling an integrated circuit on a computer system, the method comprising: starting a CAD tool on the computer system; loading a hierarchical circuit model into the CAD tool; running a non-flattened simulation of the integrated circuit at a first level of hierarchy with the CAD tool on the computer system, the simulation including an object with a node, by overlapping an inter-level cluster graph containing coupling data between the node and a second node, the second node being at a second level, with a base cluster graph of the object.
Claim 24
Dependent Claim
42 words
19 . The method of claim 17 wherein the simulation further includes a second instance of the object and a second inter-level cluster graph containing coupling data between a third node of the second instance of the object and a fourth node.
Claim 25
Dependent Claim
53 words
20 . The method of claim 17 , further comprising, after the running a non-flattened simulation step, steps of modifying the inter-level cluster graph to contain second coupling data; re-running the simulation with the second coupling data; and comparing a result from running the simulation with a second result from re-running the simulation.
References Cited (Backward Citations)
US6363516B1
Cited
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.