US20090300558A1 - Use of state nodes for efficient simulation of large digital circuits at the transistor level - Google Patents
Use of state nodes for efficient simulation of large digital circuits at the transistor levelDownload PDFInfo
- Publication number
- US20090300558A1 US20090300558A1US12/483,972US48397209AUS2009300558A1US 20090300558 A1US20090300558 A1US 20090300558A1US 48397209 AUS48397209 AUS 48397209AUS 2009300558 A1US2009300558 A1US 2009300558A1
- Authority
- US
- United States
- Prior art keywords
- state
- circuit module
- sequential
- circuit
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/32—Circuit design at the digital level
- G06F30/33—Design verification, e.g. functional simulation or model checking
Definitions
- the present inventionrelates to integrated circuit design methodologies and, in particular, to the basic design of a hierarchical device level digital simulator that utilizes the native module hierarchy of a digital circuit for efficient simulation.
- FIG. 1is a block diagram illustrating a conventional data processing system.
- FIG. 2is a flow chart illustrating a method of simulating combinatorial logic modules in accordance with the concepts of the present invention.
- FIG. 3is a flow chart illustrating a method of distinguishing between combinatorial logic circuit modules and sequential circuit modules.
- FIG. 4is a flow chart illustrating a method of simulating sequential circuit modules in accordance with the concepts of the present invention.
- FIG. 5is a schematic drawing illustrating an embodiment of a conventional circuit containing transient state points.
- FIG. 6is a flow chart illustrating a method of constructing a graph from a circuit netlist.
- FIG. 8is a flow chart illustrating a method of identifying transient state nodes from the graph representation of the circuit.
- FIG. 1shows a well-known general architecture of a data processing system 100 that can be utilized to execute a program implementation of a digital integrated circuit simulator.
- the data processing system 100includes a central processing unit (CPU) 102 and a system memory 104 that is connected to the CPU 102 .
- the system memory 104typically stores the operating system for the CPU 102 as well as data and various sets of program instructions for applications programs to be executed by the system 100 .
- the system memory 104could store a software program, i.e. a sequence of machine readable program instructions, needed to implement a method for using state nodes for the efficient simulation of digital integrated circuits at the transistor level in accordance with the concepts of the present invention.
- the computer system 100also includes a display 106 that is connected to the CPU 102 to allow images to be visually displayed to a user, a user input system 108 , e.g., a keyboard or mouse, that allows the user to interact with the system 100 , and a memory access system 110 that enables transfer of data both within the system 100 and between the system 100 and systems external to the system 100 , e.g. a computer network to which the system 100 is connected. All of these components and the ways in which they interact are well known to persons skilled in the art.
- a simulation method in accordance with the present inventiontakes advantage of the fact that, when an instance of a circuit module has been simulated under a given set of input conditions, and the resulting output values and delays have been evaluated, another instance of the same module need not be re-simulated when it has the same input combination as the prior module; the results computed earlier for the same module can be re-used.
- FIG. 2shows a flow chart of a method of simulating combinatorial logic modules in accordance with the concepts of the present invention.
- a look-up tableis maintained that stores the input-output combinations encountered for any instance of module A.
- the look-up tableis checked to determine if the current input values have been encountered in an earlier simulation of module A. If they have, then the output and delay values stored in the look-up table are used and a complete re-simulation of this instance of module A is avoided. This drastically reduces the simulation time.
- Ois the output vector
- NSis the next state
- Iis the input vector
- PSis the present state
- ⁇is a Boolean function
- the problemis how to define what is meant by a “state” of a sequential module.
- One obvious (recursive) definitionis as follows.
- the state of a moduleis defined by: (1) the state (logic value) of all of the internal nodes in the circuit; and (2) the state of all sub-modules of this module.
- this “obvious” definitionhas two major problems. First, storing the value of all of the internal nodes in a module for all its instances of that module has a huge memory overhead and a look-up table search time penalty. Second, some (or all) of the sub-modules of a module may be combinatorial in nature, making it is unnecessary to store their states.
- a state nodeis a node that can retain its logic value even in the absence of an input directly driving this node.
- a circuit moduleis termed sequential if either of the following conditions holds true: (1) the module has state nodes or (2) the module has one or more sequential sub-modules.
- the “state” of a sequential moduleis defined as follows. The state consists of: (1) the state (logic value) of all state nodes of the module and (2) the state of all sequential sub-modules of the module. Since the number of state nodes in a circuit is much less than the number of internal nodes, this definition of a module state is much more efficient in terms of both space as well as lookup time than the earlier definition.
- FIG. 3 flow chartsummarizes the process of distinguishing between combinatorial modules and sequential modules. As shown in the FIG. 3 flow, if a module A has any state nodes, then it is defined as a sequential module. If the module A has no state nodes, but includes sequential submodules, then it is defined as a sequential module. If module A has neither state nodes nor sequential submodules, then it is defined a combinatorial module and may be simulated as such in accordance with the FIG. 2 flow described above.
- simulation of an instance of a sequential module Aproceeds as follows. If the combination of the current inputs to the sequential module A and its current state exists in the look-up table, then the stored output combinations for this instance of module A are used and the current state is updated to the next state from the look-up table. Otherwise, all state nodes of the module A are initialized to the values stored in the current state. All sequential sub-modules are initialized to their states as stored in the current state. The input stimulus is provided and this instance of module A is simulated. When simulation of this instance of module A is completed (i.e., either there are no pending events or the simulation time is up), the output values are returned to storage in the look-up table table.
- next state of the moduleis then created and the values of all state nodes and the states of all sequential sub-modules are stored in the next state. Not only the last obtained value of a state node, but also the values it receives during the simulation are stored. If a state node changes value more than once (e.g., in case of a pulse), then all value changes are stored.
- some sequential circuitsmay also have “transient state points.”
- Sequential circuitshave stable state points that are capable of retaining their state (logic value) even in the absence of any input directly driving these points.
- a method for automatically identifying stable state points in transistor level digital circuitsis described in detail in co-pending and commonly assigned U.S. patent application Ser. No. 11/167,523, filed on Jun. 27, 2005, and titled “Method of Identifying State Nodes at the Transistor Level in a Sequential Digital Circuit.”
- a number of minimum combinatorial feedback loops that are present in the circuitare identified. Each minimum combinatorial feedback loop has at least one driver node.
- a driver node from each minimum combinatorial feedback loopis assigned to be a state node in accordance with predefined criteria.
- Application Ser. No. 11/167,523is hereby incorporated by reference in its entirety to provide background information regarding the present invention.
- transient state pointsIn addition to stable state points, some custom designed digital circuits include what will be referred to herein as “transient state points.”
- a “transient state point”is defined as follows: a node that can directly affect the value of a state point and is combinatorially driven by inputs of the circuit, but the transition delay from at least one input to the node is greater than a predefined threshold value.
- Transient state pointsneed to be identified as state points for the hierarchical simulator of the present invention to function properly. This is the case because, after every simulation of a given module, the simulator “forgets” the values at all internal nodes in the circuit, except the state points (in case of sequential circuits). The next time the module is simulated, the state points are initialized to their logic values in the previous state. All other internal nodes are initialized to X (unknown) logic state. If the transient state points are not identified as state points, then they too are initialized to X. Due to the propagation delay from the inputs, these points do not reach a valid logic value immediately.
- a stable state pointcan lose its value (and become X) if the transient state points remain at X for a considerable period of time. Hence, these points need to be identified as state points so that they will be initialized to a non-X logic value during the next simulation and prevent the stable state points from losing their values.
- FIG. 5An example circuit containing transient state points is shown in FIG. 5 .
- the stable state pointsare QB and QT, and can be detected by the state point detection algorithm described in above-referenced application Ser. No. 11/167,523.
- the nodes ag0 and ag0bare transient state points, since they affect the stable state points and the propagation delay from the inputs to these nodes is higher than a predefined threshold.
- the FIG. 5 circuitis a module of a CMOS single-port SRAM circuit.
- such a graphis constructed by applying the following rules: (1) for each node in the circuit (including input, output, inout and internal nodes of the circuit), a vertex is created in the graph, (2) for every transistor in the circuit, a directed edge is added from the vertex representing the gate node to the vertex representing the source node, a directed edge is added from the vertex representing the gate node to the vertex representing the drain node, and an undirected edge is added between the source and drain nodes, and (3) for every submodule in the circuit, a directed edge is added from each input of the sub-module to all of its outputs.
- vertex Ais denoted as the “parent” of vertex B.
- peer ATwo vertices connected by an undirected edge are called “peers.”
- the “weight” of all edgesis taken as 1.
- FIG. 7The graph created from the schematic of FIG. 5 in accordance with the FIG. 6 flow is shown in FIG. 7 .
- the power supply and group verticeshave been omitted for brevity.
- the directed edgesare shown as arrows and the undirected edges are shown as dotted lines.
- the all-pairs shortest path matrix of the graphis created, denoting the minimum path length between all pairs of vertices. This can be done using the standard Floyd Warshall's algorithm. If no path exists between a pair of nodes, then the path length is taken to be infinity. For each stable state point, a list of all it peers is made. For each such peer, if it is not an input or a stable state point, a list of all its parents is made. For each such parent, if it is not an input or a stable state point, if a path consisting of directed edges only exists from any input to the vertex, and the length of that path is greater than or equal 2, then it taken as a transient state point.
- QB and QTare stable state points, and their peer is the vertex at.
- Vertex athas three parents: node ag0, node ag0b and CT.
- CTis an input, so it cannot be a state point.
- Pathsexist from A and LME (both are inputs) to both node ag0 and node ag0b, and each path is greater than or equal to two edges in length. Hence, node ag0 and node 5 ag0b are detected to be transient state points.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Hardware Design (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Design And Manufacture Of Integrated Circuits (AREA)
Abstract
Description
- This application is divisional application of co-pending application Ser. No. 11/199,535, filed on Aug. 8, 2005, by Dastidar et al and titled “Use of State Nodes for Efficient Simulation of Large Digital Circuits at the Transistor Level.” Application Ser. No. 11/199,535 is hereby incorporated by reference herein in its entirety.
- The present invention relates to integrated circuit design methodologies and, in particular, to the basic design of a hierarchical device level digital simulator that utilizes the native module hierarchy of a digital circuit for efficient simulation.
FIG. 1 is a block diagram illustrating a conventional data processing system.FIG. 2 is a flow chart illustrating a method of simulating combinatorial logic modules in accordance with the concepts of the present invention.FIG. 3 is a flow chart illustrating a method of distinguishing between combinatorial logic circuit modules and sequential circuit modules.FIG. 4 is a flow chart illustrating a method of simulating sequential circuit modules in accordance with the concepts of the present invention.FIG. 5 is a schematic drawing illustrating an embodiment of a conventional circuit containing transient state points.FIG. 6 is a flow chart illustrating a method of constructing a graph from a circuit netlist.FIG. 7 is a graph representation of theFIG. 5 circuit created in accordance with theFIG. 6 flow.FIG. 8 is a flow chart illustrating a method of identifying transient state nodes from the graph representation of the circuit.- Software programs for use in simulating integrated circuit design and predicting the operational behavior of the circuit are well known to those skilled in the art.
FIG. 1 shows a well-known general architecture of adata processing system 100 that can be utilized to execute a program implementation of a digital integrated circuit simulator. Thedata processing system 100 includes a central processing unit (CPU)102 and asystem memory 104 that is connected to theCPU 102. Thesystem memory 104 typically stores the operating system for theCPU 102 as well as data and various sets of program instructions for applications programs to be executed by thesystem 100. For example, thesystem memory 104 could store a software program, i.e. a sequence of machine readable program instructions, needed to implement a method for using state nodes for the efficient simulation of digital integrated circuits at the transistor level in accordance with the concepts of the present invention. Typically, thecomputer system 100 also includes adisplay 106 that is connected to theCPU 102 to allow images to be visually displayed to a user, auser input system 108, e.g., a keyboard or mouse, that allows the user to interact with thesystem 100, and amemory access system 110 that enables transfer of data both within thesystem 100 and between thesystem 100 and systems external to thesystem 100, e.g. a computer network to which thesystem 100 is connected. All of these components and the ways in which they interact are well known to persons skilled in the art.- Conventional device level digital integrated circuit simulators, such as the well-known public domain tool IRSIM, supported by the University of California—Berkeley, work on “flat” circuits, that is, circuits that have no module hierarchy. Thus, a hierarchical circuit must be flattened to transistor level before it will work on these conventional simulators. This approach has a major drawback. Most digital circuits, whether custom designed (e.g., memories) or standard cell based (e.g., ASICs), make extensive re-use of the same building blocks or lower level modules. For example, the major portion of a static random access memory (SRAM) circuit is made up of multiple repetitions of the same six-transistor memory core cell. A flattened netlist for the SRAM design does not reflect this fact. Simulations of identical circuit modules are repeated for each occurrence of the module in the circuit, resulting in a relatively time-consuming operation.
- A simulation method in accordance with the present invention takes advantage of the fact that, when an instance of a circuit module has been simulated under a given set of input conditions, and the resulting output values and delays have been evaluated, another instance of the same module need not be re-simulated when it has the same input combination as the prior module; the results computed earlier for the same module can be re-used.
FIG. 2 shows a flow chart of a method of simulating combinatorial logic modules in accordance with the concepts of the present invention. As shown inFIG. 2 , for a module A in the hierarchy of an integrated circuit design, a look-up table is maintained that stores the input-output combinations encountered for any instance of module A. When an instance of module A needs re-simulation (i.e., one or more of its inputs change value), the look-up table is checked to determine if the current input values have been encountered in an earlier simulation of module A. If they have, then the output and delay values stored in the look-up table are used and a complete re-simulation of this instance of module A is avoided. This drastically reduces the simulation time. When the current input values for module A are not present in the look-up table, then a simulation is performed and the output and delay results for that instance of module A are stored in the look-up table and can be used in future re-simulations of that particular instance of module A.- The method described above works for purely combinatorial modules, since the output values and delays of a combinatorial module are governed solely by its inputs. However, for sequential modules, the output conditions of the module depend not only upon the inputs, but also upon the present state of the module. Thus, for sequential circuits, not only the input-output combinations, but also the states must be stored. For each instance of a module in the sequential circuit, its present state must be stored in the look-up table. During a simulation, the output combinations of that instance of the module are determined based upon the input values and the present state. After the simulation, the state of the module instance is updated to the next state. As is well known, this relation can be expressed as:
(O, NS)=ƒ(I, PS) (1)- where, O is the output vector, NS is the next state, I is the input vector, PS is the present state, and ƒis a Boolean function.
- The problem is how to define what is meant by a “state” of a sequential module. One obvious (recursive) definition is as follows. The state of a module is defined by: (1) the state (logic value) of all of the internal nodes in the circuit; and (2) the state of all sub-modules of this module. However, this “obvious” definition has two major problems. First, storing the value of all of the internal nodes in a module for all its instances of that module has a huge memory overhead and a look-up table search time penalty. Second, some (or all) of the sub-modules of a module may be combinatorial in nature, making it is unnecessary to store their states.
- The present invention makes use of “state nodes” to circumvent the above-described problem. Intuitively, a state node is a node that can retain its logic value even in the absence of an input directly driving this node. In accordance with the invention, a circuit module is termed sequential if either of the following conditions holds true: (1) the module has state nodes or (2) the module has one or more sequential sub-modules.
- The “state” of a sequential module is defined as follows. The state consists of: (1) the state (logic value) of all state nodes of the module and (2) the state of all sequential sub-modules of the module. Since the number of state nodes in a circuit is much less than the number of internal nodes, this definition of a module state is much more efficient in terms of both space as well as lookup time than the earlier definition.
- The
FIG. 3 flow chart summarizes the process of distinguishing between combinatorial modules and sequential modules. As shown in theFIG. 3 flow, if a module A has any state nodes, then it is defined as a sequential module. If the module A has no state nodes, but includes sequential submodules, then it is defined as a sequential module. If module A has neither state nodes nor sequential submodules, then it is defined a combinatorial module and may be simulated as such in accordance with theFIG. 2 flow described above. - With reference to the
FIG. 4 flow chart, in accordance with the present invention, simulation of an instance of a sequential module A proceeds as follows. If the combination of the current inputs to the sequential module A and its current state exists in the look-up table, then the stored output combinations for this instance of module A are used and the current state is updated to the next state from the look-up table. Otherwise, all state nodes of the module A are initialized to the values stored in the current state. All sequential sub-modules are initialized to their states as stored in the current state. The input stimulus is provided and this instance of module A is simulated. When simulation of this instance of module A is completed (i.e., either there are no pending events or the simulation time is up), the output values are returned to storage in the look-up table table. The next state of the module is then created and the values of all state nodes and the states of all sequential sub-modules are stored in the next state. Not only the last obtained value of a state node, but also the values it receives during the simulation are stored. If a state node changes value more than once (e.g., in case of a pulse), then all value changes are stored. - In addition to the state points described above, some sequential circuits may also have “transient state points.”
- Sequential circuits have stable state points that are capable of retaining their state (logic value) even in the absence of any input directly driving these points. A method for automatically identifying stable state points in transistor level digital circuits is described in detail in co-pending and commonly assigned U.S. patent application Ser. No. 11/167,523, filed on Jun. 27, 2005, and titled “Method of Identifying State Nodes at the Transistor Level in a Sequential Digital Circuit.” In the method disclosed in application Ser. No. 11/167,523, a number of minimum combinatorial feedback loops that are present in the circuit are identified. Each minimum combinatorial feedback loop has at least one driver node. A driver node from each minimum combinatorial feedback loop is assigned to be a state node in accordance with predefined criteria. Application Ser. No. 11/167,523 is hereby incorporated by reference in its entirety to provide background information regarding the present invention.
- In addition to stable state points, some custom designed digital circuits include what will be referred to herein as “transient state points.” A “transient state point” is defined as follows: a node that can directly affect the value of a state point and is combinatorially driven by inputs of the circuit, but the transition delay from at least one input to the node is greater than a predefined threshold value.
- Transient state points need to be identified as state points for the hierarchical simulator of the present invention to function properly. This is the case because, after every simulation of a given module, the simulator “forgets” the values at all internal nodes in the circuit, except the state points (in case of sequential circuits). The next time the module is simulated, the state points are initialized to their logic values in the previous state. All other internal nodes are initialized to X (unknown) logic state. If the transient state points are not identified as state points, then they too are initialized to X. Due to the propagation delay from the inputs, these points do not reach a valid logic value immediately. Since they can directly affect the value of stable state points, a stable state point can lose its value (and become X) if the transient state points remain at X for a considerable period of time. Hence, these points need to be identified as state points so that they will be initialized to a non-X logic value during the next simulation and prevent the stable state points from losing their values.
- An example circuit containing transient state points is shown in
FIG. 5 . In theFIG. 5 circuit, the stable state points are QB and QT, and can be detected by the state point detection algorithm described in above-referenced application Ser. No. 11/167,523. The nodes ag0 and ag0b are transient state points, since they affect the stable state points and the propagation delay from the inputs to these nodes is higher than a predefined threshold. TheFIG. 5 circuit is a module of a CMOS single-port SRAM circuit. - An algorithm for detecting transient state points in accordance with the concepts of the present invention will now be described with reference to the
FIG. 6 flow chart. - A graph G=(V, E1, E2) is defined where V is a set of vertices, E1is a set of directed edges, and E2is a set of undirected edges. There can be both a directed edge and an undirected edge between a pair of vertices in the graph. Given the schematic of a circuit containing stable state points, such a graph is constructed by applying the following rules: (1) for each node in the circuit (including input, output, inout and internal nodes of the circuit), a vertex is created in the graph, (2) for every transistor in the circuit, a directed edge is added from the vertex representing the gate node to the vertex representing the source node, a directed edge is added from the vertex representing the gate node to the vertex representing the drain node, and an undirected edge is added between the source and drain nodes, and (3) for every submodule in the circuit, a directed edge is added from each input of the sub-module to all of its outputs.
- If there is a directed edge from vertex A to vertex B, then vertex A is denoted as the “parent” of vertex B. Two vertices connected by an undirected edge are called “peers.” The “weight” of all edges is taken as 1.
- The graph created from the schematic of
FIG. 5 in accordance with theFIG. 6 flow is shown inFIG. 7 . The power supply and group vertices have been omitted for brevity. The directed edges are shown as arrows and the undirected edges are shown as dotted lines. - Referring to the
FIG. 8 flow chart, once a graph of the type shown inFIG. 7 has been created, the following steps are applied. Using only the directed edges, the all-pairs shortest path matrix of the graph is created, denoting the minimum path length between all pairs of vertices. This can be done using the standard Floyd Warshall's algorithm. If no path exists between a pair of nodes, then the path length is taken to be infinity. For each stable state point, a list of all it peers is made. For each such peer, if it is not an input or a stable state point, a list of all its parents is made. For each such parent, if it is not an input or a stable state point, if a path consisting of directed edges only exists from any input to the vertex, and the length of that path is greater than or equal 2, then it taken as a transient state point. - In the
FIG. 7 graph, QB and QT are stable state points, and their peer is the vertex at. Vertex at has three parents: node ag0, node ag0b and CT. CT is an input, so it cannot be a state point. Paths exist from A and LME (both are inputs) to both node ag0 and node ag0b, and each path is greater than or equal to two edges in length. Hence, node ag0 and node5 ag0b are detected to be transient state points. - It should be understood that the particular embodiments of the invention described above have been provided by way of example and that other modifications may occur to those skilled in the art without departing from the scope and spirit of the invention as expressed in the appended claims and their equivalents.
Claims (4)
1. A method of representing the state of a sequential digital integrated circuit, the method comprising:
identifying the state (logic value) of all state nodes in the circuit; and
identifying the state of all sequential submodules of the circuit.
2. A method of simulating a sequential digital circuit module given a set of input conditions and a current state, the method comprising:
initializing all state nodes of the circuit module to logic values stored in the current state;
initializing all sequential submodules of the circuit module to the states stored in the current state;
simulating the circuit module after initialization;
after completion of the simulation step, reporting the output logic values and associated delays and storing the logic values of the state nodes and the states of the sequential submodules in the next state of the circuit module, multiple value changes in the state nodes of the circuit module being recorded in the next state.
3. A machine-readable medium having stored thereon sequences of instructions for implementing a method of representing the state of a sequential digital integrated circuit, the instruction sequences including instructions that, when executed by a data processing system, cause the data processing system to perform:
identifying the state (logic value) of all state nodes in the circuit; and
identifying the state of all sequential submodules of the circuit.
4. A machine-readable medium having stored thereon sequences of instructions for implementing a method of simulating a sequential digital circuit module given a set of input conditions and a current state, the instructions sequences including instructions that, when executed by a data processing system, cause the data processing system to perform:
initializing all state nodes of the circuit module to logic values stored in the current state;
initializing all sequential submodules of the circuit module to the states stored in the current state;
simulating the circuit module after initialization; and
after completion of the simulation step, reporting the ouput logic values and associated delays and storing the logic values of the state nodes and the states of the sequential submodules in the next state of the circuit module, multiple value changes in the state nodes of the circuit module being recorded in the next state.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US12/483,972US20090300558A1 (en) | 2005-08-08 | 2009-06-12 | Use of state nodes for efficient simulation of large digital circuits at the transistor level |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US11/199,535US7581199B1 (en) | 2005-08-08 | 2005-08-08 | Use of state nodes for efficient simulation of large digital circuits at the transistor level |
| US12/483,972US20090300558A1 (en) | 2005-08-08 | 2009-06-12 | Use of state nodes for efficient simulation of large digital circuits at the transistor level |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| US11/199,535DivisionUS7581199B1 (en) | 2005-08-08 | 2005-08-08 | Use of state nodes for efficient simulation of large digital circuits at the transistor level |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| US20090300558A1true US20090300558A1 (en) | 2009-12-03 |
Family
ID=40973520
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| US11/199,535Active2026-09-27US7581199B1 (en) | 2005-08-08 | 2005-08-08 | Use of state nodes for efficient simulation of large digital circuits at the transistor level |
| US12/483,972AbandonedUS20090300558A1 (en) | 2005-08-08 | 2009-06-12 | Use of state nodes for efficient simulation of large digital circuits at the transistor level |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| US11/199,535Active2026-09-27US7581199B1 (en) | 2005-08-08 | 2005-08-08 | Use of state nodes for efficient simulation of large digital circuits at the transistor level |
Country Status (1)
| Country | Link |
|---|---|
| US (2) | US7581199B1 (en) |
Citations (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5163016A (en)* | 1990-03-06 | 1992-11-10 | At&T Bell Laboratories | Analytical development and verification of control-intensive systems |
| US5481469A (en)* | 1993-09-13 | 1996-01-02 | Vlsi Technology, Inc. | Automatic power vector generation for sequential circuits |
| US5550760A (en)* | 1993-02-18 | 1996-08-27 | Digital Equipment Corporation | Simulation of circuits |
| US5666288A (en)* | 1995-04-21 | 1997-09-09 | Motorola, Inc. | Method and apparatus for designing an integrated circuit |
| US5668732A (en)* | 1994-06-03 | 1997-09-16 | Synopsys, Inc. | Method for estimating power consumption of a cyclic sequential electronic circuit |
| US5732192A (en)* | 1994-11-30 | 1998-03-24 | The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration | Global qualitative flow-path modeling for local state determination in simulation and analysis |
| US5748486A (en)* | 1994-10-28 | 1998-05-05 | Nec Usa, Inc. | Breadth-first manipulation of binary decision diagrams |
| US5910897A (en)* | 1994-06-01 | 1999-06-08 | Lsi Logic Corporation | Specification and design of complex digital systems |
| US6009256A (en)* | 1997-05-02 | 1999-12-28 | Axis Systems, Inc. | Simulation/emulation system and method |
| US6148436A (en)* | 1998-03-31 | 2000-11-14 | Synopsys, Inc. | System and method for automatic generation of gate-level descriptions from table-based descriptions for electronic design automation |
| US6157903A (en)* | 1998-03-12 | 2000-12-05 | Synopsys, Inc. | Method of minimizing macrocell characterization time for state dependent power analysis |
| US6182268B1 (en)* | 1998-01-05 | 2001-01-30 | Synplicity, Inc. | Methods and apparatuses for automatic extraction of finite state machines |
| US6389586B1 (en)* | 1998-01-05 | 2002-05-14 | Synplicity, Inc. | Method and apparatus for invalid state detection |
| US6427223B1 (en)* | 1999-04-30 | 2002-07-30 | Synopsys, Inc. | Method and apparatus for adaptive verification of circuit designs |
| US20020133325A1 (en)* | 2001-02-09 | 2002-09-19 | Hoare Raymond R. | Discrete event simulator |
| US6499129B1 (en)* | 1998-07-22 | 2002-12-24 | Circuit Semantics, Inc. | Method of estimating performance of integrated circuit designs |
| US20030036894A1 (en)* | 2001-08-20 | 2003-02-20 | William Lam | Method and apparatus for amortizing critical path computations |
| US6625786B2 (en)* | 2000-12-14 | 2003-09-23 | Tharas Systems, Inc. | Run-time controller in a functional verification system |
| US20040044510A1 (en)* | 2002-08-27 | 2004-03-04 | Zolotov Vladamir P | Fast simulaton of circuitry having soi transistors |
| US20040078175A1 (en)* | 2001-10-29 | 2004-04-22 | Queen In Right Of Canada As Rep By Min Of Nat Def | Method and apparatus for modeling and simulating the effects of bridge defects in integrated circuits |
| US6807520B1 (en)* | 2000-12-11 | 2004-10-19 | Synopsys, Inc. | System and method for simulation of an integrated circuit design using a hierarchical input netlist and divisions along hierarchical boundaries thereof |
| US20060074622A1 (en)* | 2004-07-12 | 2006-04-06 | Mentor Graphics Corp. | Software state replay |
| US7031896B1 (en)* | 2000-06-30 | 2006-04-18 | Intel Corporation | Methods for performing generalized trajectory evaluation |
| US7216307B1 (en)* | 2005-06-27 | 2007-05-08 | National Semiconductor Corporation | Method of identifying state nodes at the transistor level in a sequential digital circuit using minimum combinatorial feedback loop |
| US7404160B2 (en)* | 2005-02-18 | 2008-07-22 | Quickturn Design Systems Inc. | Method and system for hardware based reporting of assertion information for emulation and hardware acceleration |
| US7636903B2 (en)* | 2003-09-12 | 2009-12-22 | Infineon Technologies Ag | Device and method for testing an electric circuit |
- 2005
- 2005-08-08USUS11/199,535patent/US7581199B1/enactiveActive
- 2009
- 2009-06-12USUS12/483,972patent/US20090300558A1/ennot_activeAbandoned
Patent Citations (27)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5163016A (en)* | 1990-03-06 | 1992-11-10 | At&T Bell Laboratories | Analytical development and verification of control-intensive systems |
| US5550760A (en)* | 1993-02-18 | 1996-08-27 | Digital Equipment Corporation | Simulation of circuits |
| US5481469A (en)* | 1993-09-13 | 1996-01-02 | Vlsi Technology, Inc. | Automatic power vector generation for sequential circuits |
| US5910897A (en)* | 1994-06-01 | 1999-06-08 | Lsi Logic Corporation | Specification and design of complex digital systems |
| US5668732A (en)* | 1994-06-03 | 1997-09-16 | Synopsys, Inc. | Method for estimating power consumption of a cyclic sequential electronic circuit |
| US5748486A (en)* | 1994-10-28 | 1998-05-05 | Nec Usa, Inc. | Breadth-first manipulation of binary decision diagrams |
| US5732192A (en)* | 1994-11-30 | 1998-03-24 | The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration | Global qualitative flow-path modeling for local state determination in simulation and analysis |
| US5666288A (en)* | 1995-04-21 | 1997-09-09 | Motorola, Inc. | Method and apparatus for designing an integrated circuit |
| US6009256A (en)* | 1997-05-02 | 1999-12-28 | Axis Systems, Inc. | Simulation/emulation system and method |
| US6389586B1 (en)* | 1998-01-05 | 2002-05-14 | Synplicity, Inc. | Method and apparatus for invalid state detection |
| US6182268B1 (en)* | 1998-01-05 | 2001-01-30 | Synplicity, Inc. | Methods and apparatuses for automatic extraction of finite state machines |
| US6157903A (en)* | 1998-03-12 | 2000-12-05 | Synopsys, Inc. | Method of minimizing macrocell characterization time for state dependent power analysis |
| US6148436A (en)* | 1998-03-31 | 2000-11-14 | Synopsys, Inc. | System and method for automatic generation of gate-level descriptions from table-based descriptions for electronic design automation |
| US6499129B1 (en)* | 1998-07-22 | 2002-12-24 | Circuit Semantics, Inc. | Method of estimating performance of integrated circuit designs |
| US6851095B1 (en)* | 1998-07-22 | 2005-02-01 | Magma Design Automation, Inc. | Method of incremental recharacterization to estimate performance of integrated disigns |
| US6427223B1 (en)* | 1999-04-30 | 2002-07-30 | Synopsys, Inc. | Method and apparatus for adaptive verification of circuit designs |
| US7031896B1 (en)* | 2000-06-30 | 2006-04-18 | Intel Corporation | Methods for performing generalized trajectory evaluation |
| US6807520B1 (en)* | 2000-12-11 | 2004-10-19 | Synopsys, Inc. | System and method for simulation of an integrated circuit design using a hierarchical input netlist and divisions along hierarchical boundaries thereof |
| US6625786B2 (en)* | 2000-12-14 | 2003-09-23 | Tharas Systems, Inc. | Run-time controller in a functional verification system |
| US20020133325A1 (en)* | 2001-02-09 | 2002-09-19 | Hoare Raymond R. | Discrete event simulator |
| US20030036894A1 (en)* | 2001-08-20 | 2003-02-20 | William Lam | Method and apparatus for amortizing critical path computations |
| US20040078175A1 (en)* | 2001-10-29 | 2004-04-22 | Queen In Right Of Canada As Rep By Min Of Nat Def | Method and apparatus for modeling and simulating the effects of bridge defects in integrated circuits |
| US20040044510A1 (en)* | 2002-08-27 | 2004-03-04 | Zolotov Vladamir P | Fast simulaton of circuitry having soi transistors |
| US7636903B2 (en)* | 2003-09-12 | 2009-12-22 | Infineon Technologies Ag | Device and method for testing an electric circuit |
| US20060074622A1 (en)* | 2004-07-12 | 2006-04-06 | Mentor Graphics Corp. | Software state replay |
| US7404160B2 (en)* | 2005-02-18 | 2008-07-22 | Quickturn Design Systems Inc. | Method and system for hardware based reporting of assertion information for emulation and hardware acceleration |
| US7216307B1 (en)* | 2005-06-27 | 2007-05-08 | National Semiconductor Corporation | Method of identifying state nodes at the transistor level in a sequential digital circuit using minimum combinatorial feedback loop |
Also Published As
| Publication number | Publication date |
|---|---|
| US7581199B1 (en) | 2009-08-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7788616B2 (en) | Method and system for performing heuristic constraint simplification | |
| Hura et al. | The use of Petri nets to analyze coherent fault trees | |
| US6807520B1 (en) | System and method for simulation of an integrated circuit design using a hierarchical input netlist and divisions along hierarchical boundaries thereof | |
| US6378112B1 (en) | Verification of design blocks and method of equivalence checking of multiple design views | |
| Xing et al. | Combinatorial algorithm for reliability analysis of multistate systems with propagated failures and failure isolation effect | |
| US7475371B2 (en) | Method and system for case-splitting on nodes in a symbolic simulation framework | |
| US20090044157A1 (en) | Acyclic Modeling of Combinational Loops | |
| US7594200B2 (en) | Method for finding multi-cycle clock gating | |
| US7921394B2 (en) | Enhanced verification through binary decision diagram-based target decomposition | |
| Abramovici et al. | Concurrent fault simulation and functional level modeling | |
| US20080104558A1 (en) | Method and System for Enhanced Verification Through Structural Target Decomposition | |
| US6397370B1 (en) | Method and system for breaking complex Boolean networks | |
| US7412695B1 (en) | Transient state nodes and a method for their identification | |
| Pandey et al. | Exploiting symmetry when verifying transistor-level circuits by symbolic trajectory evaluation | |
| US5796621A (en) | Circuit delay abstraction tool | |
| US7031889B1 (en) | Method and apparatus for evaluating the design quality of network nodes | |
| Drechsler | Verification of multi-valued logic networks | |
| US7581199B1 (en) | Use of state nodes for efficient simulation of large digital circuits at the transistor level | |
| CN117371371A (en) | Circuit gate level logic simulation method, device, computer equipment and storage medium | |
| US7246334B1 (en) | Topological analysis based method for identifying state nodes in a sequential digital circuit at the transistor level | |
| Tsui et al. | Exact and approximate methods for switching activity estimation in sequential logic circuits | |
| Mador-Haim et al. | Input elimination and abstraction in model checking | |
| Satyanarayana et al. | A hierarchical approach to transistor-level power estimation of arithmetic units | |
| Jain et al. | Verification of regular arrays by symbolic simulation | |
| CN113450558A (en) | Method, system and storage medium for identifying network key node |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| STCB | Information on status: application discontinuation | Free format text:ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |