Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
342 words
A machine process for converting a behavioral representation of an electronic integrated circuit from one form to another form; said behavioral representation of the electronic integrated circuit, in one form, has a plurality of inputs and a plurality of outputs, and a plurality of nodes interconnecting a plurality of logical elements, which are in the primitives of a first simulator; said behavioral representation in another form is generated for further processing by a second simulator and is in the primitives and in the syntax of the second simulator; said machine process being implemented by the use of a programmed digital computer having stored therein a program; said method comprising the steps of: (a) inputting data on pin locations, logic equation and timing delays from said inputs to said outputs of said electronic integrated circuit, into said program; (b) generating a first representation of said electronic integrated circuit based upon said data on said pin locations, logic equation and timing delays, said first representation having a plurality of nodes interconnecting a plurality of first electronic logic circuit elements, each of said elements is a primitive of said first simulator; (c) converting said first representation into a second representation, which is a logical equivalent of said first representation, in accordance with the rules of boolean algebra, and in accordance with the following: (i) changing representations of all directly serially connected first electronic logic circuit elements into a representation of a second electronic logic circuit element; (ii) changing said first electronic logic circuit elements into electronic logic circuit elements of said second representation, which are primitives of said second simulation program, but which are not directly serially connected primitives; (d) determining the timing delay for each electronic logic circuit element of said second representation; (e) converting said second representation into a third representation by converting all of the electronic logic circuit elements of said second representation into primitives of said second simulation program; and (f) generating said third representation in the syntax of said second simulation program for further processing by said second simulation program.
Claim 2
Dependent Claim
342 words
A machine process for converting a behavioral representation of an electronic integrated circuit from one form to another form; said behavioral representation of the electronic integrated circuit, in one form, has a plurality of inputs and a plurality of outputs, and a plurality of nodes interconnecting a plurality of logical elements, which are in the primitives of a first simulator; said behavioral representation in another form is generated for further processing by a second simulator and is in the primitives and in the syntax of the second simulator; said machine process being implemented by the use of a programmed digital computer having stored therein a program; said method comprising the steps of: (a) inputting data on pin locations, logic equation and timing delays from said inputs to said outputs of said electronic integrated circuit, into said program; (b) generating a first representation of said electronic integrated circuit based upon said data on said pin locations, logic equation and timing delays, said first representation having a plurality of nodes interconnecting a plurality of first electronic logic circuit elements, each of said elements is a primitive of said first simulator; (c) converting said first representation into a second representation, which is a logical equivalent of said first representation, in accordance with the rules of boolean algebra, and in accordance with the following: (i) changing representations of all directly serially connected first electronic logic circuit elements into a representation of a second electronic logic circuit element; (ii) changing said first electronic logic circuit elements into electronic logic circuit elements of said second representation, which are primitives of said second simulation program, but which are not directly serially connected primitives; (d) determining the timing delay for each electronic logic circuit element of said second representation; (e) converting said second representation into a third representation by converting all of the electronic logic circuit elements of said second representation into primitives of said second simulation program; and (f) generating said third representation in the syntax of said second simulation program for further processing by said second simulation program.
Claim 3
Dependent Claim
60 words
The method of claim 1 wherein said determining step further comprises: (a) determining all possible signal paths from said input to said output; (b) forming a set of simultaneous equations with a variable for each timing delay for each electronic logic circuit element, and one equation for each signal path; (c) solving said set of simultaneous equations for each variable.
Claim 4
Dependent Claim
24 words
The method of claim 2, wherein said solving step comprises: minimizing the error in a Simplex algorithm solution of said set of simultaneous equations.
Claim 5
Dependent Claim
12 words
The method of claim 3 wherein said logic equation specifies a flip-flop.
Claim 6
Dependent Claim
48 words
The method of claim 4 further comprising the step of creating a plurality of representations for each flip-flop, with each one of said plurality of representations comprising one or more interconnected primitives of said first simulator; using one of said plurality of representations in said first representation generated.
Claim 7
Dependent Claim
194 words
The method of claim 5, in the event said error in a Simplex algorithm solution is non-zero, further comprising the following steps: (a) forming a first representation of another flip-flop; (b) transforming said first representation of step (a) in accordance with the rules of boolean algebra, and in accordance with the following: (i) changing representations of all directly serially connected first electronic logic circuit elements into a representation of a second electronic logic circuit element; (ii) changing said first electronic logic circuit elements into electronic logic circuit elements of said second representation, which are primitives of said second simulation program but which are not directly serially connected primitives; (c) determining the time delay for each electronic logic circuit element of said second representation; (d) repeating the steps (a) and (b) herein in the event said error in a Simplex algorithm solution is non-zero; and (e) continuing with the following steps otherwise, (i) converting said second representation into a third representation by converting all of the electronic logic circuit elements of said second representation into primitives of said second simulation program; and (ii) generating said third representation in the syntax of said second simulation program.