Fast Batch and Incremental Netlist Compilation of Hierarchical Schematics

Abstract

We present fast batch and incremental algorithms for creating and updating the netlist underlying a hierarchial schematic design. The algorithms can be used either for maintaining the netlist as a data structure for further online processing or as a file for use with other offline design tools that are down stream from the compilation process. The batch algorithm uses a preorder traversal of the design hierarchy to derive the netlist. The incremental algorithm trims this traversal to only those paths leading to changes in the netlist. For most user modifications the netlist can be incrementally updated in a fraction of the time required using batch compilation techniques, often with no preceivable delay to the user. © 1991 IEEE