Automated optimization of hierarchical netlists

• US 5,956,257 A
• Filed: 03/31/1993
• Issued: 09/21/1999
• Est. Priority Date: 03/31/1993
• Status: Expired due to Term

• Current Assignee: NXP B.V. (NXP Semiconductors NV)
• Original Assignee: VLSI Technology, Inc. (Koninklijke Philips N.V.)
• Inventors: Ginetti, Arnold, Schaefer, Thomas J., Shur, Robert D., Kingsley, Christopher H.
• Primary Examiner(s): Teska, Kevin J.
• Assistant Examiner(s): PHAN, THAI Q
• Application Number:
  US08/040,738
• Time in Patent Office: 2,365 Days
• Field of Search: 364/488, 364/489, 364/490, 364/491, 364/578, 364/900
• US Class Current: 716/103
• CPC Class Codes: G06F 30/327 Logic synthesis; Behaviour synthesis, e.g. mapping logic, HDL to netlist, high-level language to RTL or netlist

Abstract

A method of automatically optimizing a hierarchical netlist of integrated circuit cells comprising at least one upper-level cell containing a multiplicity of subsidiary cells of lower hierachical level includes receiving data defining said netlist and timing constraints for it, and establishing abstract timing models for all the subsidiary cells. Timing constraints are propagated to at least one selected subsidiary cell and this cell is optimized by means of a flat optimizer to produced an optimized version of the selected subsidiary cell. The optimized version of the selected cell is inserted into the netlist. The timing constraints denote arrival times for signals at inputs of a cell and required times for signals at outputs of a cell and each abstract timing model of a cell comprises timing parameters which enable a delay time between a specified input of a cell to a specified output of a cell to be computed.

Claims

1. A method of automatically optimizing a hierarchical netlist of integrated circuit cells comprising at least one upper-level cell containing a multiplicity of subsidiary cells of lower hierarchical level, the method comprising the steps, performed by a programmed data processor, of:

(i) receiving data defining said hierarchical netlist and timing constraints therefor;

(ii) establishing abstract timing models for all of said subsidiary cells;

(iii) propagating timing constraints to at least one selected subsidiary cell of said subsidiary cells;

(iv) optimizing said selected subsidiary cell by means of a flat optimizer to produce an optimized version of said selected subsidiary cell, wherein said upper-level cell contains a multiplicity of instances of said selected subsidiary cell, said optimizing step including the steps of

propagating said timing constraints to each of a multiplicity of different cells of said selected subsidiary cell,

merging said timing constraints for said multiplicity of instances of said selected subsidiary cell, to provide a merged set of timing constraints for all of said instances of said selected subsidiary cell, and

optimizing, in accordance with said merged set of timing constraints a single instance of said selected subsidiary cell with said flat optimizer, to produce said optimized version of said selected subsidiary cell; and

(v) substituting said optimized version of said selected subsidiary cell for all instances of said selected subsidiary cell into said netlist.

2. A method according to claim 1 wherein the said timing constraints denote arrival times for signals at inputs of a cell and required times for signals at outputs of a cell.

3. A method according to claim 2 wherein each abstract timing model of a cell comprises timing parameters which enable a delay time between-a specified input of a cell to a specified output of a cell to be computed.

4. A method according to claim 3 wherein the netlist comprises at least one top-level cell containing instances of intermediate level cells each of which contains instances of lowest level cells, said lowest level cells having predefined abstract timing models, and wherein the said establishing step comprises:

computing the abstract timing models for all the intermediate level cells in ascending hierachical order beginning with the lowest level cells.

5. A method according to claim 1, further comprising:

recomputing abstract timing models for all higher cells than said selected susidiary cell subsequent to the substitution of the optimized version of the subcell into the netlist.

6. A method of fabricating an application-specific integrated circuit from a user-selected, input specification of said circuit, comprising the steps of:

(a) performing by an automatic programmed data processor which includes a cell library the following steps;

(1) responding to said user-selected, input specification to synthesize and generate a netlist composed of cells from said cell library;

(2) optimizing said netlist; and

(3) generating semiconductor mask data from the optimized netlist; and

(b) fabricating the integrated circuit under control of said mask data;

wherein said netlist is a hierarchical netlist of integrated circuit cells comprising at least one upper-level cell containing a multiplicity of subsidiary cells of lower hierarchical level, said upper-level cell being incapable of optimization by a flat optimizer, and wherein the optimizing step comprises;

(i) receiving data defining said netlist and timing constraints therefor;

(ii) establishing abstract timing models for all said subsidiary cells;

(iii) propagating timing constraints to at least one selected subsidiary cell;

(iv) optimizing said selected cell by means of a flat optimizer to produce an optimized version of said selected subsidiary cell, wherein said upper-level cell contains a multiplicity of instances of said selected subsidiary cell, said optimizing step including the steps of

propagating said timing constraints to each of a multiplicity of different cells of said selected subsidiary cell,

merging the timing constraints for the multiplicity of instances of said selected subsidiary cell, to provide a merged set of timing constraints for all of said instances of said selected subsidiary cell, and

optimizing, in accordance with said merged set of timing constraints a single instance of said selected subsidiary cell with said flat optimizer, to produce said optimized version of said selected subsidiary cell; and

(v) substituting said optimized version of said selected subsidiary cell for all instances of said selected subsidiary cell into said netlist.

7. A method according to claim 6 wherein the said timing constraints denote arrival times for signals at inputs of a cell and required times for signals at outputs of a cell.

8. A method according to claim 6 wherein each abstract timing model of a cell comprises timing parameters which enable a delay time between a specified input of a cell to a specified output of a cell to be computed.

9. A method according to claim 6 wherein the netlist comprises at least one top-level cell containing instances of intermediate level cells each of which contains instances of lowest level cells, said lowest level cells having predefined abstract timing models, and wherein the said establishing step comprises:

computing the abstract timing models for all the intermediate level cells in ascending hierachical order beginning with the lowest level cells.

10. A method according to claim 6, wherein said upper-level contains a multiplicity of instances of the said selected subsidiary cell and the method further comprises:

propagating said timing constraints to each of a multiplicity of different instances of the selected subsidiary cell;

merging the timing constraints for the multiplicity of instances of the selected subsidiary cell, to provide a merged set of timing constraints for all the said instances of the subsidiary cell;

optimizing in accordance with the said merged set of timing constraints a single instance of the said subsidiary cell by means of said flat optimizer, to produce said optimized version of the said subsidiary cell; and

substituting the optimized version of the subsidiary cell for all the instances of the subsidiary cell in the multiplicity thereof.

11. A method according to claim 6, further comprising:

recomputing abstract timing models for all higher cells than said selected susidiary cell subsequent to the substitution of the optimized version of the subcell into the netlist.