US5404311A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of optimizing delay times
Assignee: Fujitsu Ltd
•
Filing: 1993-06-15
•
Granted: 1995-04-04
•
Expires: 2013-06-15
Abstract
Abstract The present invention relates to a delay time optimizing method of optimizing delay times and a method of optimizing delay times in an LSI equipped with latch circuits at its input and output. The method divides a plurality of logic circuits from a combinatorial circuit located among latch circuits for outputting data related to input data in response to clocks, calculates the delay time of a path between each of the latch circuits at end points and each of the latch circuits at starting points, performing the weighting related to the delay time on each of the distinguished logic circuits located between each of the starting points and each of the end points for each path, and calculates a relative index for changing the delay time for each logic circuit.
Inventors
- 👤 Yutaka Isoda
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 17:50
CPC Classifications
H; H10; H10D; H10D89/00; H10D89/10; H10D89/105; G; G06; G06F; G06F30/00; G06F30/30; G06F30/32; G06F30/327
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
160 words
The method of designing a semiconductor IC circuit composed of at least a combinatorial circuit and a plurality of latch circuits, a method of optimizing delay times characterized by comprising the steps of: dividing logic circuits that are not directly dependent on two or more signals from the combinational logic circuit located among the latch circuits for inputting and outputting data in response to a clock; determining latch circuits serving as end points and latch circuits serving as start points; calculating the delay time of a path of the combinational logic circuit between each of the latch circuits serving as the end points and each of the latch circuits serving as the starting points; performing weighting related to the delay time on each of the distinguished combinational logic circuits located between the starting points and the end points for each path; and calculating a relative index for changing the delay time from the resultant weighting for each combinational logic circuit.
Claim 2
Independent Claim
160 words
The method of designing a semiconductor IC circuit composed of at least a combinatorial circuit and a plurality of latch circuits, a method of optimizing delay times characterized by comprising the steps of: dividing logic circuits that are not directly dependent on two or more signals from the combinational logic circuit located among the latch circuits for inputting and outputting data in response to a clock; determining latch circuits serving as end points and latch circuits serving as start points; calculating the delay time of a path of the combinational logic circuit between each of the latch circuits serving as the end points and each of the latch circuits serving as the starting points; performing weighting related to the delay time on each of the distinguished combinational logic circuits located between the starting points and the end points for each path; and calculating a relative index for changing the delay time from the resultant weighting for each combinational logic circuit.
Claim 3
Dependent Claim
32 words
The method of optimizing delay times according to claim 1 wherein the relative index of the combinational logic circuit is data on the size of a transistor constructing the combinational logic circuit.
Claim 4
Dependent Claim
57 words
The method of optimizing delay times according to claim 1 wherein the weighting is selective allocation of a value obtained by normalizing the delay time of the combinational logic circuit between the latch circuits by a desired delay time of the semiconductor IC circuit to be designed to provide the combinational logic circuit associated with the path.
Claim 5
Dependent Claim
55 words
The method of optimizing delay times according to claim 3 wherein, when normalized values of the delay times of a plurality of paths extending to the same end-point latch are greater than unity, the selective allocation multiplies the relative index of a combinational logic circuit that is common to the paths by the normalized value.
Claim 6
Dependent Claim
51 words
The method of optimizing delay times according to claim 3 wherein, when the initial size of the transistor is assumed to be 1, the relative index determines the size of the transistor according to the result obtained by multiplying the initial size value by the normalized value of the delay time.
Claim 7
Dependent Claim
66 words
The method of optimizing delay times according to claim 3 wherein, when the normalized value of the delay time of a path to an end-point latch is smaller than 1, the selective allocation multiplies the relative index of a combinational logic circuit associated with that path other than combinational logic circuits associated with other paths whose normalized values are greater than 1 by the normalized value.
Claim 8
Dependent Claim
41 words
The method of optimizing delay times according to claim 6 wherein the relative index determines the size of a transistor according to the result obtained by multiplying the initial size of a transistor assumed to be 1 by the normalized value.
Claim 9
Dependent Claim
36 words
The method of optimizing delay times according to claim 1 wherein a gate of the combinational logic circuit is improved by the relative index and this process is repeated again to thereby provide more optimum gate.
Claim 10
Dependent Claim
42 words
The method of optimizing delay times according to claim 1 wherein the combinational logic circuits that are not directly dependent on two or more signals are one-input combinational logic circuits which uniquely determine the combinational logic circuit having a plurality of inputs.
References Cited (Backward Citations)
US4263651A
Cited
US4827428A
Cited
US5251147A
Cited
US5218551A
Cited
US5197015A
Cited
US5237514A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-04-03 | 1998-10-03 | 1999-04-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-04-03 | 2002-10-03 | 2003-04-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-04-03 | 2006-10-03 | 2007-04-04 | $7700.00 | Window Closed / Lapsed |