Pattern-matching for transistor level netlists
AssigneeInternational Business Machines Corporation
InventorsValerie D. Lehner, John M. Cohn, Ulrich A. Finkler
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorsValerie D. Lehner, John M. Cohn, Ulrich A. Finkler
Estimating the term…
A single pattern-matching algorithm which allows both exact and inexact pattern-matching so that transistor-level design automation tools can reliably perform timing analysis, electrical rules checking, noise analysis, test pattern generation, formal design verification, and the like prior to manufacturing custom logic. The user (circuit designer) specifies which of each of the pattern external nets may be matched inexactly (attached to Vdd, attached to GND, and shorted to other external nets), with the remainder of the pattern external net connections being matched using exact isomorphism constraints. The method described herein achieves a substantial reduction in the number of patterns which circuit designers must generate, and altogether eliminates the need for an exponential number of patterns by providing an inexact pattern matcher to circuit designers. It further provides rooted sub-graph isomorphism so that a user can query whether a particular pattern is embedded at a particular location in the main circuit design, utilizing inexact sub-graph isomorphism
A method of matching a pattern sub-circuit in a master circuit design, the master circuit design being both formed by a plurality of master devices interconnected by master nets and modeled as a graph, and the pattern sub-circuit being formed by a plurality of pattern devices interconnected by pattern nets and modeled as a graph, wherein both nets and devices are explicitly modeled as nodes in the graphs, enabling both exact and inexact pattern matching using a single pattern matching engine, the method comprising the steps of:
A method of matching a pattern sub-circuit in a master circuit design, the master circuit design being both formed by a plurality of master devices interconnected by master nets and modeled as a graph, and the pattern sub-circuit being formed by a plurality of pattern devices interconnected by pattern nets and modeled as a graph, wherein both nets and devices are explicitly modeled as nodes in the graphs, enabling rooted sub-graph isomorphism and enabling both exact and inexact pattern matching using a single pattern matching engine, the method comprising the steps of:
A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for matching a pattern sub-circuit in a master circuit design, the master circuit design being both formed by a plurality of master devices interconnected by master nets and modeled as a graph, and the pattern sub-circuit being formed by a plurality of pattern devices interconnected by pattern nets and modeled as a graph, wherein both nets and devices are explicitly modeled as nodes in the graphs, enabling both exact and inexact pattern matching using a single pattern matching engine, the method comprising the steps of:
Dependencies are inferred from the claim text.