Optimizing a netlist circuit representation by leveraging binary decision diagrams to perform rewriting
AssigneeInternational Business Machines Corporation
InventorsJason Baumgartner, Geert Janssen, Robert Kanzelman, Viresh Paruthi
Life of this patent
Estimating the term…
Abstract
Leveraging existing Binary Decision Diagrams (BDDs) to enhance circuit reductions in a system model representing a state machine as a netlist. The netlist is evaluated to determine the regions with the greatest potential reductions. BDD sweeping is performed to identify redundancies in the netlist. BDD rewriting implements the circuit reductions by replacing gates of the original netlist with more efficient equivalent logic.
Claims28
A method of redesigning a circuit by reducing a netlist representation of the circuit, wherein the circuit comprises a plurality of nodes including a node, the method comprising:
- obtaining through use of a computer a plurality of Binary Decision Diagram (BDD) representations associated with said node in the netlist;
- identifying a reduction in the netlist by synthesizing one of the plurality of BDD representations as a netlist region associated with the node;
- modifying the netlist representation using the identified netlist region associated with the node to produce a rewritten netlist representation;
- and
- redesigning the circuit based on the rewritten netlist representation.
A software product comprising a non-transitory machine readable medium including a program of instructions for redesigning a circuit by reducing a netlist representation of the circuit, wherein the circuit comprises a plurality of nodes including a node, wherein the program of instructions upon being executed on a computer causes the computer to perform activities comprising:
- obtaining a plurality of Binary Decision Diagram (BDD) representations associated with said node in the netlist;
- identifying a reduction in the netlist by synthesizing one of the plurality of BDD representations as a netlist region associated with the node;
- modifying the netlist representation using the identified netlist region associated with the node to produce a rewritten netlist representation;
- and
- redesigning the circuit based on the rewritten netlist representation.
A method of redesigning a circuit by reducing a netlist representation of the circuit, wherein the circuit comprises a plurality of nodes including a node, the method comprising:
- obtaining through use of a computer a plurality of Binary Decision Diagram (BDD) representations associated with said node in the netlist;
- identifying a reduction in the netlist by synthesizing one of the plurality of BDD representations as a netlist region associated with the node;
- creating a new netlist representation using the identified netlist region associated with the node;
- and
- redesigning the circuit based on the new netlist representation.
A software product comprising a non-transitory machine readable medium including a program of instructions for redesigning a circuit by reducing a netlist representation of the circuit, wherein the circuit comprises a plurality of nodes including a node, and wherein the program of instructions upon being executed on a computer causes the computer to perform activities comprising:
- obtaining a plurality of Binary Decision Diagram (BDD) representations associated with said node in the netlist;
- identifying a reduction in the netlist by synthesizing one of the plurality of BDD representations as a netlist region associated with the node;
- creating a new netlist representation using the identified netlist region associated with the node;
- and
- redesigning the circuit based on the new netlist representation.
Dependencies are inferred from the claim text.