Optimization of timing models using bus compression
AssigneeSynopsys, Inc.
InventorsPaul Berevoescu, Oleg Levitsky
Life of this patent
Estimating the term…
Loading patent…
AssigneeSynopsys, Inc.
InventorsPaul Berevoescu, Oleg Levitsky
Estimating the term…
Abstract of the Disclosure A method of compressing bus-related model data for transistor-level timing arcs in a circuit timing model. Compressed model syntax and timing information are provided for the following node-to-node transistor level representations: many-to-many bitwise, many-to-many, one-to-many, and many-to-one. In the many-to-many bitwise embodiment, each of the consecutive start nodes is coupled to a different end node. In the many-to-many embodiment, the plurality of consecutive transistor-level timing arcs have consecutive start nodes on a first bus and consecutive end nodes on a second bus, and each of the consecutive start nodes is coupled to each of the consecutive end nodes. In the many-to-one embodiment, the plurality of consecutive transistor-level timing arcs have consecutive start nodes on a first bus and a common end node on a second bus. In the one-to-many embodiment, the plurality of consecutive transistor-level timing arcs have a common start node on a first bus and consecutive end nodes on a second bus.
In a circuit timing model, a method of compressing bus-related model data for transistor-level timing arcs having a plurality of start nodes coupled to a plurality of end nodes, said method comprising the computer-implemented steps of:a) comparing timing information for a first transistor-level timing arc and timing information for a second transistor-level timing arc having consecutive start nodes on a first bus and consecutive end nodes on a second bus;b) calculating a figure of merit using said timing information for said first transistor-level timing arc and said timing information for said second transistor-level timing arc,
The method as recited in Claim 1 further comprising the step of:
The method as recited in Claim 2 further comprising the steps of:
The method as recited in Claim 3 wherein said figure of merit is a difference between a first timing information and a second timing information.
The method as recited in Claim 3 wherein said figure of merit is a ratio between a first timing information and a second timing information.
The method as recited in Claim 3 wherein timing information includes delay times.
The method as recited in Claim 3 wherein timing information includes setup times and hold times.
The method as recited in Claim 1 wherein each of said plurality of start nodes is coupled to each of said plurality of end nodes.
The method as recited in Claim 1 wherein each of said plurality of start nodes is coupled to a different end node.
n a circuit timing model, a method of compressing bus-related model data for transistor-level timing arcs having a plurality of start nodes coupled to a common end node, said method comprising the computer-implemented steps of:a) comparing timing information for a first transistor-level timing arc and timing information for a second transistor-level timing arc having consecutive start nodes on a first bus and a common end node on a second bus;b) calculating a figure of merit using said timing information for said first transistor-level timing arc and said timing information for said second transistor-level timing arc,
The method as recited in Claim 10 further comprising the step of:
The method as recited in Claim 11 further comprising the steps of:
The method as recited in Claim 12 wherein said figure of merit is a difference between a first timing information and a second timing information.
The method as recited in Claim 12 wherein said figure of merit is a ratio between a first timing information and a second timing information.
The method as recited in Claim 12 wherein timing information includes delay times.
The method as recited in Claim 12 wherein timing information includes setup times and hold times.
In a circuit timing model, a method of compressing bus-related model data for transistor-level timing arcs having a common start node coupled to a plurality of end nodes, said method comprising the computer-implemented steps of:a) comparing timing information for a first transistor-level timing arc and timing information for a second transistor-level timing arc having a common start node on a first bus and consecutive end nodes on a second bus;b) calculating a figure of merit using said timing information for said first transistor-level timing arc and said timing information for said second transistor-level timing arc,
The method as recited in Claim 17 further comprising the step of:
The method as recited in Claim 18 further comprising the steps of:
The method as recited in Claim 19 wherein said figure of merit is a difference between a first timing information and a second timing information.
The method as recited in Claim 19 wherein said figure of merit is a ratio between a first set of timing information and a second set of timing information.
The method as recited in Claim 19 wherein timing information includes delay times.
The method as recited in Claim 19 wherein timing information includes setup times and hold times.
A computer system comprising:an address/data bus;a processor coupled to said address/data bus;a computer-readable memory unit coupled to said address/data bus;said processor for performing a method of compressing bus-related model data for a plurality of transistor-level timing arcs, said method comprising the steps of:a) comparing timing information for a first transistor-level timing arc and timing information for a second transistor-level timing arc;b) calculating a figure of merit using said timing information for said first transistor-level timing arc and said timing information for said second transistor-level timing arc,
The method as recited in Claim 24 further comprising the steps of:
The computer system of Claim 25 wherein said timing information includes delay times.
The computer system of Claim 25 wherein said timing information includes setup times and hold times.
The computer system of Claim 25 wherein said figure of merit is a difference between a first timing information and a second timing information.
The computer system of Claim 25 wherein said figure of merit is aratio between a first timing information and a second timing information.
The computer system of Claim 25 wherein said acceptance value is specified based on user input.
The computer system of Claim 24 wherein said plurality of consecutive transistor-level timing arcs have consecutive start nodes on a first bus and consecutive end nodes on a second bus, wherein each of said consecutive start nodes is coupled to each of said consecutive end nodes.
The computer system of Claim 24 wherein said plurality of consecutive transistor-level timing arcs have consecutive start nodes on a first bus and consecutive end nodes on a second bus, wherein each of said consecutive start nodes is coupled to a different end node.
The computer system of Claim 24 wherein said plurality of consecutive transistor-level timing arcs have consecutive start nodes on a first bus and a common end node on a second bus.
The computer system of Claim 24 wherein said plurality of consecutive transistor-level timing arcs have a common start node on a first bus and consecutive end nodes on a second bus.