Patent US6167557A successfully refreshed from Google Patents.
← Back to Patent Explorer
US6167557A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for logic synthesis employing size independent timing optimization

Assignee: GlobalFoundries Inc
•
Filing: 1998-04-28
•
Granted: 2000-12-26
•
Expires: 2018-04-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Size independent timing optimization is performed on an initial circuit design using gain based models for logic cell types. A component library containing various logic elements in a plurality of sizes is provided and a single gain based model for each logic element (cell type) is created therefrom. Initial conditions for gain and delay are then established for each cell type. Gain based optimization, which is size independent, is then performed on the initial circuit design. The optimized size independent solution is then transformed into a realizable discrete circuit solution.

Inventors

  • 👤 Prabhakarn N. Kudva
  • 👤 David S. Kung
  • 👤 Leon Stok

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 12:10
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; G06F30/32; G06F30/327

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 125 words
A method for performing size independent optimization of a logic circuit design comprising the steps of: creating a gain-based model for each cell type in a logic library; deriving initial conditions for a gain and a delay for each of said cell types, said deriving step includes the steps of: selecting an initial gain value for a selected cell type; calculating an initial scalable delay for said selected cell type; setting the initial scalable delay for the remaining cell types equal to said calculated initial scalable delay; and calculating an initial gain value for said remaining cell types; performing gain-based optimization of the circuit design; and transforming the optimized circuit design into a discrete solution with conventional library elements, resulting in an optimized circuit embodiment.
Claim 2
Independent Claim 125 words
A method for performing size independent optimization of a logic circuit design comprising the steps of: creating a gain-based model for each cell type in a logic library; deriving initial conditions for a gain and a delay for each of said cell types, said deriving step includes the steps of: selecting an initial gain value for a selected cell type; calculating an initial scalable delay for said selected cell type; setting the initial scalable delay for the remaining cell types equal to said calculated initial scalable delay; and calculating an initial gain value for said remaining cell types; performing gain-based optimization of the circuit design; and transforming the optimized circuit design into a discrete solution with conventional library elements, resulting in an optimized circuit embodiment.
Claim 3
Dependent Claim 59 words
The method for performing size independent timing optimization as defined by claim 1, wherein said creating step includes the steps of: empirically evaluating a gain-delay characteristic at a plurality of points for at least one element in each of said cell types; fitting a curve to said plurality of points; and solving a gain-delay equation based on said curve.
Claim 4
Independent Claim 151 words
A method for performing size independent optimization of a logic circuit design comprising the steps of: creating a gain-based model for each cell type in a logic library; deriving initial conditions for a gain and a delay for each of said cell types; performing gain-based optimization of the circuit design, said gain-based optimization step includes the steps of: selecting a set of trial gain values; assigning an initial gain value from said set to an output stage of the circuit; heuristically determining gain values of stages preceding the output stage; selecting a next value in said set; repeating said assigning and heuristically determining steps until all trial gain values in said set are evaluated; and determining which trial gain value resulted in the optimum delay solution from said set of trials; and transforming the optimized circuit design into a discrete solution with conventional library elements, resulting in an optimized circuit embodiment.
Claim 5
Independent Claim 151 words
A method for performing size independent optimization of a logic circuit design comprising the steps of: creating a gain-based model for each cell type in a logic library; deriving initial conditions for a gain and a delay for each of said cell types; performing gain-based optimization of the circuit design, said gain-based optimization step includes the steps of: selecting a set of trial gain values; assigning an initial gain value from said set to an output stage of the circuit; heuristically determining gain values of stages preceding the output stage; selecting a next value in said set; repeating said assigning and heuristically determining steps until all trial gain values in said set are evaluated; and determining which trial gain value resulted in the optimum delay solution from said set of trials; and transforming the optimized circuit design into a discrete solution with conventional library elements, resulting in an optimized circuit embodiment.
Claim 6
Dependent Claim 84 words
The method for performing size independent timing optimization as defined by claim 3, wherein said heuristic determining step further includes the steps of: (a) setting a pointer to a current stage in the circuit; (b) calculating the load capacitance of said current stage in the circuit corresponding to said pointer; (c) calculating the gain of a previous stage in the circuit; (d) decrementing said pointer; and (e) repeating steps b) through d) until the pointer is directed to the second stage in the circuit.
Claim 7
Dependent Claim 33 words
The method for performing size independent timing optimization as defined by claim 3, wherein said gain-based optimization step includes the steps of: design rule checking after said repeating step; and performing area recovery.
Claim 8
Independent Claim 148 words
A method for performing size independent optimization of a logic circuit design comprising the steps of: creating a gain-based model for each cell type in a logic library; deriving initial conditions for a gain and a delay for each of said cell types; performing gain-based optimization of the circuit design; and transforming the optimized circuit design into a discrete solution with conventional library elements, resulting in an optimized circuit embodiment, said transforming step includes the steps of: determining whether the cell types are defined by a continuous model; if said cell types are defined by a continuous model, selecting a size of each element in the circuit design based on a size/load curve provided by said model; and if said cell types are not defined by a continuous model, selecting a discrete embodiment from the library for each element in the circuit design that minimizes a design error.
Claim 9
Independent Claim 148 words
A method for performing size independent optimization of a logic circuit design comprising the steps of: creating a gain-based model for each cell type in a logic library; deriving initial conditions for a gain and a delay for each of said cell types; performing gain-based optimization of the circuit design; and transforming the optimized circuit design into a discrete solution with conventional library elements, resulting in an optimized circuit embodiment, said transforming step includes the steps of: determining whether the cell types are defined by a continuous model; if said cell types are defined by a continuous model, selecting a size of each element in the circuit design based on a size/load curve provided by said model; and if said cell types are not defined by a continuous model, selecting a discrete embodiment from the library for each element in the circuit design that minimizes a design error.
Claim 10
Dependent Claim 26 words
The method for performing size independent timing optimization as defined by claim 6, wherein said circuit design is represented in the form of a net list.
Claim 11
Dependent Claim 207 words
A computer based logic circuit synthesis and optimization system comprising: an optimization processor; a logic cell library including a plurality of cell types, each cell type having at least one associated logic element, said logic cell library being operatively coupled to said optimization processor; a storage medium having stored codes executable by said optimization processor for causing the optimization processor to execute method steps in providing gain-based optimization of a logic circuit design, the method steps including: selecting a set of trial gain values; assigning an initial gain value from said set to an output stage of the circuit; heuristically determining gain values of stages preceding the output stage; selecting a next value in said set; repeating said assigning and heuristically determining steps until all trial gain values in said set are evaluated; and determining which trial gain value resulted in the optimum delay solution from said set of trial; and a gain based model library, said gain based model library including a size independent model for each cell type employed in said circuit design, said optimization processor receiving said circuit design, said logic cell library including said plurality of cell types of different sizes, and said gain based model library and providing an optimized circuit design.
Claim 12
Dependent Claim 207 words
A computer based logic circuit synthesis and optimization system comprising: an optimization processor; a logic cell library including a plurality of cell types, each cell type having at least one associated logic element, said logic cell library being operatively coupled to said optimization processor; a storage medium having stored codes executable by said optimization processor for causing the optimization processor to execute method steps in providing gain-based optimization of a logic circuit design, the method steps including: selecting a set of trial gain values; assigning an initial gain value from said set to an output stage of the circuit; heuristically determining gain values of stages preceding the output stage; selecting a next value in said set; repeating said assigning and heuristically determining steps until all trial gain values in said set are evaluated; and determining which trial gain value resulted in the optimum delay solution from said set of trial; and a gain based model library, said gain based model library including a size independent model for each cell type employed in said circuit design, said optimization processor receiving said circuit design, said logic cell library including said plurality of cell types of different sizes, and said gain based model library and providing an optimized circuit design.
Claim 13
Dependent Claim 34 words
A computer based logic synthesis and optimization system as defined by claim 8, wherein: said logic cell library is a discrete library; and said gain based model library is generated by said optimization processor.
Claim 14
Dependent Claim 24 words
A computer based logic synthesis and optimization system as defined by claim 8, further including a graphical user interface for providing a circuit design.
Claim 15
Dependent Claim 34 words
A computer based logic synthesis and optimization system as defined by claim 10, wherein said graphical user interface includes means for converting a circuit representation from a graphical representation to a net list representation.
Claim 16
Dependent Claim 29 words
A computer based logic synthesis and optimization system as defined by claim 11, wherein said graphical user interface receives and displays the optimized circuit design from said optimization processor.
Claim 17
Dependent Claim 28 words
The computer based logic synthesis and optimization system as defined by claim 10, further including a logic synthesis engine for providing a net list to said optimization processor.

References Cited (Backward Citations)

US4903241A Cited
US5282148A Cited
US5274568A Cited
US5471409A Cited
US5467034A Cited
US5768130A Cited
US5636130A Cited
US5982315A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2003-12-26 2004-06-26 2004-12-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2007-12-26 2008-06-26 2008-12-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2011-12-26 2012-06-26 2012-12-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag