Patent US6026220A successfully refreshed from Google Patents.
US6026220A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for incremntally optimizing a circuit design
Assignee: Unisys Corp
•
Filing: 1996-11-19
•
Granted: 2000-02-15
•
Expires: 2016-11-19
Abstract
Abstract A method and apparatus for incrementally optimizing a circuit design. The present invention provides an iterative EDA process that only requires the optimization, placement and routing of the actual changes made during a each design iteration, and leaves the remainder of the circuit design in a fixed state.
Inventors
- 👤 Kevin C. Cleereman
- 👤 Kenneth E. Merryman
- 👤 Steve D. Thatcher
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 04:34
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30
Claims Analysis
Total Claims: 35
Claim 1
Independent Claim
164 words
A data processing system for incrementally optimizing a current version of a circuit design, wherein the current version of the circuit design is stored in a current circuit design database, and includes a number of incremental changes from a previous version of the circuit design, the previous version of the circuit design is stored in a previous circuit design database, the previous circuit design database further includes a corresponding previously optimized circuit design, the data processing system comprising: a. determining means for comparing the current circuit design database and the previous circuit design database to identify the number of incremental changes therebetween; b. merging means coupled to said determining means for merging selected ones of the number of incremental changes and the previously optimized circuit design, thereby resulting in a partially optimized circuit design; and c. optimizing means coupled to said merging means for optimizing at least a portion of the partially optimized circuit design, including selected ones of the number of incremental changes.
Claim 2
Dependent Claim
164 words
A data processing system for incrementally optimizing a current version of a circuit design, wherein the current version of the circuit design is stored in a current circuit design database, and includes a number of incremental changes from a previous version of the circuit design, the previous version of the circuit design is stored in a previous circuit design database, the previous circuit design database further includes a corresponding previously optimized circuit design, the data processing system comprising: a. determining means for comparing the current circuit design database and the previous circuit design database to identify the number of incremental changes therebetween; b. merging means coupled to said determining means for merging selected ones of the number of incremental changes and the previously optimized circuit design, thereby resulting in a partially optimized circuit design; and c. optimizing means coupled to said merging means for optimizing at least a portion of the partially optimized circuit design, including selected ones of the number of incremental changes.
Claim 3
Dependent Claim
36 words
A data processing system according to claim 1, wherein said merging means includes substituting means for substituting a number of portions of the previously optimized circuit design with corresponding ones of the number of incremental changes.
Claim 4
Dependent Claim
40 words
A data processing system according to claim 1, wherein said determining means further identifies a no-change list, wherein the no-change list identifies selected portions of the current circuit design database that have not changed from the previous circuit design database.
Claim 5
Dependent Claim
37 words
A data processing system according to claim 3, wherein said optimizing means is further coupled to said merging means, said optimizing means optimizing the partially optimized circuit design except for those portions identified by said no-change list.
Claim 6
Dependent Claim
29 words
A data processing system according to claim 1, wherein said determining means compares the current circuit design database and the previous circuit design database using a cone-graph compare algorithm.
Claim 7
Dependent Claim
49 words
A data processing system according to claim 1, wherein the current circuit design database includes a number of sub-portions and the previous circuit design database includes a number of corresponding sub-portions, and wherein selected ones of the sub-portions are assigned an updated revision identifier by a revision control block.
Claim 8
Dependent Claim
35 words
A data processing system according to claim 6, wherein said determining means respectively compares the revision control identifiers of sub-portions of the current circuit design database with corresponding sub-portions of the previous circuit design database.
Claim 9
Dependent Claim
48 words
A data processing system according to claim 1, wherein said optimizing means is further coupled to an optimization control block, wherein said optimization control block provides a number of optimization control parameters to said optimizing means, said optimization control parameters influencing the optimization methodology of said optimizing means.
Claim 10
Dependent Claim
34 words
A data processing system according to claim 8, wherein selected ones of said optimization control parameters indicate that selected portions of the partially optimized circuit design are to be optimized to minimize power consumption.
Claim 11
Dependent Claim
33 words
A data processing system according to claim 8, wherein selected ones of said optimization control parameters indicate that selected portions of the partially optimized circuit design are to be optimized to maximize performance.
Claim 12
Dependent Claim
33 words
A data processing system according to claim 8, wherein selected ones of said optimization control parameters indicate that selected portions of the partially optimized circuit design are to be optimized to minimize area.
Claim 13
Dependent Claim
38 words
A data processing system according to claim 8, wherein selected ones of said optimization control parameters indicate that selected portions of the partially optimized circuit design are to be optimized to conform to a predefined set of rules.
Claim 14
Dependent Claim
18 words
A data processing system according to claim 8, wherein said optimization control parameters are defined by a user.
Claim 15
Dependent Claim
21 words
A data processing system according to claim 13, wherein said user defines said optimization control parameters via a spread sheet interface.
Claim 16
Dependent Claim
20 words
A data processing system according to claim 13, wherein said user defines said optimization control parameters via a menu interface.
Claim 17
Dependent Claim
158 words
A data processing system for incrementally optimizing a current version of a circuit design, wherein the current version of the circuit design is stored in a current circuit design database, and includes a number of incremental changes from a previous version of the circuit design, the previous version of the circuit design is stored in a previous circuit design database, the previous circuit design database further includes a corresponding previously optimized circuit design, the data processing system comprising: a. determining means for comparing the current circuit design database and the previous circuit design database to identify the number of incremental changes therebetween; b. optimizing means coupled to said determining means for optimizing selected ones of the number of incremental changes, thereby resulting in a number of optimized incremental changes; and c. merging means coupled to said optimizing means for merging selected ones of the number of optimized incremental changes and selected portions of the previous optimized circuit design.
Claim 18
Dependent Claim
158 words
A data processing system for incrementally optimizing a current version of a circuit design, wherein the current version of the circuit design is stored in a current circuit design database, and includes a number of incremental changes from a previous version of the circuit design, the previous version of the circuit design is stored in a previous circuit design database, the previous circuit design database further includes a corresponding previously optimized circuit design, the data processing system comprising: a. determining means for comparing the current circuit design database and the previous circuit design database to identify the number of incremental changes therebetween; b. optimizing means coupled to said determining means for optimizing selected ones of the number of incremental changes, thereby resulting in a number of optimized incremental changes; and c. merging means coupled to said optimizing means for merging selected ones of the number of optimized incremental changes and selected portions of the previous optimized circuit design.
Claim 19
Independent Claim
156 words
A method for incrementally optimizing a current version of a circuit design operable on a computer wherein the current version of the circuit design is represented in a current circuit design database, and includes a number of incremental changes from a previous version of the circuit design, the previous version of the circuit design is represented in a previous circuit design database, the previous circuit design database further includes a corresponding previously optimized circuit design, the method comprising the steps of: a. comparing the current circuit design database and the previous circuit design database to identify at least some of the number of incremental changes therebetween; b. merging selected ones of the number of incremental changes and selected portions of the previous optimized circuit design, thereby resulting in a partially optimized circuit design; and c. selectively optimizing at least a portion of the partially optimized circuit design, including selected ones of the number of incremental changes.
Claim 20
Independent Claim
156 words
A method for incrementally optimizing a current version of a circuit design operable on a computer wherein the current version of the circuit design is represented in a current circuit design database, and includes a number of incremental changes from a previous version of the circuit design, the previous version of the circuit design is represented in a previous circuit design database, the previous circuit design database further includes a corresponding previously optimized circuit design, the method comprising the steps of: a. comparing the current circuit design database and the previous circuit design database to identify at least some of the number of incremental changes therebetween; b. merging selected ones of the number of incremental changes and selected portions of the previous optimized circuit design, thereby resulting in a partially optimized circuit design; and c. selectively optimizing at least a portion of the partially optimized circuit design, including selected ones of the number of incremental changes.
Claim 21
Dependent Claim
35 words
A method according to claim 17, wherein said merging step includes a substituting step for substituting a number of portions of the previously optimized circuit design with corresponding ones of the number of incremental changes.
Claim 22
Dependent Claim
38 words
A method according to claim 17, wherein said comparing step further identifies a no-change list, wherein the no-change list identifies selected portions of the current circuit design database that have not changed from the previous circuit design database.
Claim 23
Dependent Claim
25 words
A method according to claim 19, wherein said optimizing step optimizes the partially optimized circuit design except for those portions identified by said no-change list.
Claim 24
Dependent Claim
27 words
A method according to claim 17, wherein said comparing step compares the current circuit design database and the previous circuit design database using a cone-graph compare algorithm.
Claim 25
Dependent Claim
53 words
A method according to claim 17, further comprising a revision control step, wherein the current circuit design database includes a number of sub-portions and the previous circuit design database includes a number of corresponding sub-portions, and wherein selected ones of these sub-portions are assigned an updated revision identifier during the revision control step.
Claim 26
Dependent Claim
34 words
A method according to claim 22, wherein said comparing step compares the revision control identifiers of selected sub-portions of the current circuit design database with selected corresponding sub-portions of the previous circuit design database.
Claim 27
Dependent Claim
31 words
A method according to claim 17, further comprising a providing step wherein said providing step provides a number of optimization control parameters that affect the optimization methodology of said optimizing step.
Claim 28
Dependent Claim
16 words
A method according to claim 24, wherein said optimization control parameters are defined by a user.
Claim 29
Dependent Claim
19 words
A method according to claim 25, wherein said user defines said optimization control parameters via a spread sheet interface.
Claim 30
Dependent Claim
18 words
A method according to claim 25, wherein said user defines said optimization control parameters via a menu interface.
Claim 31
Dependent Claim
67 words
A method according to claim 17, further including the steps of: a. determining if there are any incremental changes in a selected portion of the current circuit design database; and b. skipping the optimization step for said selected portion of the current circuit design database if the determining step (a) determines that there are no incremental changes in the selected portion of the current circuit design database.
Claim 32
Independent Claim
144 words
A method for incrementally optimizing a current version of a circuit design operable on a computer, wherein the current version of the circuit design is represented in a current circuit design database, and includes a number of incremental changes from a previous version of the circuit design, the previous version of the circuit design is represented in a previous circuit design database, the previous circuit design database further includes a corresponding previously optimized circuit design, the method comprising the steps of: a. comparing the current circuit design database and the previous circuit design database to identify at least some of the number of incremental changes therebetween; b. optimizing selected ones of the number of incremental changes, thereby resulting in a number of optimized incremental changes; and c. merging selected ones of the optimized incremental changes and selected portions of the previously optimized circuit design.
Claim 33
Independent Claim
144 words
A method for incrementally optimizing a current version of a circuit design operable on a computer, wherein the current version of the circuit design is represented in a current circuit design database, and includes a number of incremental changes from a previous version of the circuit design, the previous version of the circuit design is represented in a previous circuit design database, the previous circuit design database further includes a corresponding previously optimized circuit design, the method comprising the steps of: a. comparing the current circuit design database and the previous circuit design database to identify at least some of the number of incremental changes therebetween; b. optimizing selected ones of the number of incremental changes, thereby resulting in a number of optimized incremental changes; and c. merging selected ones of the optimized incremental changes and selected portions of the previously optimized circuit design.
Claim 34
Dependent Claim
67 words
A method according to claim 29, further including the steps of: a. determining if there are any incremental changes in a selected portion of the current circuit design database; and b. skipping the optimization step for said selected portion of the current circuit design database if the determining step (a) determines that there are no incremental changes in the selected portion of the current circuit design database.
Claim 35
Dependent Claim
21 words
A data processing system according to claim 1, wherein said optimizing means operates on said circuit design at a structural level.
References Cited (Backward Citations)
US4758953A
Cited
US5050091A
Cited
US4831543A
Cited
US5175696A
Cited
US5222029A
Cited
US5267175A
Cited
US4918614A
Cited
US5164908A
Cited
US5490268A
Cited
US5623418A
Cited
US5801958A
Cited
US5557531A
Cited
US5544066A
Cited
US5359537A
Cited
US5255363A
Cited
US5406497A
Cited
US5416721A
Cited
US5355317A
Cited
US5357440A
Cited
US5359523A
Cited
US5490266A
Cited
US5418954A
Cited
US5485396A
Cited
US5341309A
Cited
US5349659A
Cited
US5398195A
Cited
US5418733A
Cited
US5361357A
Cited
US5491640A
Cited
US5483461A
Cited
US5440720A
Cited
US5493508A
Cited
US5649165A
Cited
US5805861A
Cited
US7757657B2
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-02-14 | 2003-08-16 | 2004-02-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-02-14 | 2007-08-16 | 2008-02-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-02-14 | 2011-08-16 | 2012-02-15 | $7700.00 | Window Closed / Lapsed |