Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
132 words
A method for generating a gate-level netlist for a macrocell simulation model from a physical layout of said macrocell, comprising the steps of: generating a circuit-level netlist from a physical layout of said macrocell; identifying each true root present in said circuit-level netlist; for each true root identified, identifying from said circuit-level netlist successive circuit nodes of a tree associated therewith; for each of said successive circuit nodes of a tree, successively determining a respective Boolean equation based on circuit elements connected thereto, in accordance with a set of relationship rules pertinent to circuit elements of said macrocell and a set of logical value assignment definition rules, said identified circuit nodes including a set of output nodes; and converting the Boolean equation for said set of output nodes into a gate-level netlist.
Claim 2
Independent Claim
132 words
A method for generating a gate-level netlist for a macrocell simulation model from a physical layout of said macrocell, comprising the steps of: generating a circuit-level netlist from a physical layout of said macrocell; identifying each true root present in said circuit-level netlist; for each true root identified, identifying from said circuit-level netlist successive circuit nodes of a tree associated therewith; for each of said successive circuit nodes of a tree, successively determining a respective Boolean equation based on circuit elements connected thereto, in accordance with a set of relationship rules pertinent to circuit elements of said macrocell and a set of logical value assignment definition rules, said identified circuit nodes including a set of output nodes; and converting the Boolean equation for said set of output nodes into a gate-level netlist.
Claim 3
Dependent Claim
27 words
A method as in claim 1, wherein said Boolean equation conversion step comprises the step of converting said Boolean equations into a set of logical operator expressions.
Claim 4
Dependent Claim
22 words
A method as in claim 2, wherein said Boolean equation conversion step further comprising the step of reducing said logical operator expressions.
Claim 5
Dependent Claim
54 words
A method as in claim 3, wherein said Boolean equation conversion step further comprises the steps of: generating a first truth table from said set of logical operator expressions; generating a second truth table from said reduced set of logical operator expressions; and comparing said first and second truth tables to confirm the reduction.
Claim 6
Dependent Claim
48 words
A method as in claim 1, further comprising the steps of: generating a truth table from the Boolean equations for said set of output nodes; and comparing said generated truth table to a known correct truth table to confirm the Boolean equations for said set of output nodes.
Claim 7
Dependent Claim
29 words
A method as in claim 1, wherein said step of identifying from said circuit-level netlist successive circuit noes of a tree comprises traversing said tree in a depth-first traversal.
Claim 8
Dependent Claim
29 words
A method as in claim 1, wherein said step of identifying from said circuit-level netlist successive circuit nodes of a tree comprises traversing said tree in a breadth-first traversal.
Claim 9
Dependent Claim
251 words
A method as in claim 1, wherein: said relationship rules are relationship rules pertinent to a transistor and resistor of an ECL-type circuit, and specify that: for a resistor having two terminals, the terminal closest said root is the "father" and the other terminal is the "son;" and for a transistor having three terminals, the emitter terminal is the "father," the base terminal is the "daughter," and the collector terminal is the "son;" and said logical value assignment definition rules are definition rules pertaining to an ECL-type circuit, and specify that: for a resistor, the logical value of the son equals the logical value of the father; for a transistor, the logical value of the collector equals the AND of the logical value of the emitter and the logical value of the base; the logical value of a root is ONE; the logical value of a bias signal for a current source equals ONE; the logical value of a bias signal for a current switch equals the complement of the logical value of the base of a switching transistor associated with said current switch; the logical value of a supernode equals the OR of the logical values of all collectors tied to said supernode; the logical value of an input translator with plural inputs equals the OR of the logical values of said plural inputs; and the logical value of an output node equals the complement of the logical value of a base of a transistor associated with said output node.
Claim 10
Dependent Claim
33 words
A method as in claim 1, further comprising the step of preprocessing said circuit-level netlist prior to said circuit node identifying step, said Boolean equation determining step, and said Boolean equation conversion step.
Claim 11
Dependent Claim
27 words
A method as in claim 9, wherein said preprocessing step comprises the steps of: extracting parallel transistors and resistors; preprocessing output emitter followers; and preprocessing input transistors.
Claim 12
Independent Claim
153 words
An apparatus for generating a gate-level netlist for a macrocell simulation model from a physical layout of said macrocell, comprising: a data storage device for storing a physical layout of said macrocell; means for generating a circuit-level netlist from said physical layout of said macrocell accessed from said data storage device; means for identifying each true root present in said circuit-level netlist; means for identifying from said circuit-level netlist, for each true root identified, successive circuit nodes of a tree associated therewith; means for successively determining, at each of said successive circuit nodes, a Boolean equation based on circuit elements connected thereto, in accordance with a set of relationship rules pertinent to circuit elements of said macrocell and a set of logical value assignment definition rules, said identified circuit nodes including a set of output nodes; and means for converting the Boolean equations for said set of output nodes into a gate-level netlist.
Claim 13
Independent Claim
153 words
An apparatus for generating a gate-level netlist for a macrocell simulation model from a physical layout of said macrocell, comprising: a data storage device for storing a physical layout of said macrocell; means for generating a circuit-level netlist from said physical layout of said macrocell accessed from said data storage device; means for identifying each true root present in said circuit-level netlist; means for identifying from said circuit-level netlist, for each true root identified, successive circuit nodes of a tree associated therewith; means for successively determining, at each of said successive circuit nodes, a Boolean equation based on circuit elements connected thereto, in accordance with a set of relationship rules pertinent to circuit elements of said macrocell and a set of logical value assignment definition rules, said identified circuit nodes including a set of output nodes; and means for converting the Boolean equations for said set of output nodes into a gate-level netlist.