Hierarchical Netlist Extraction and Design Rule Check

摘要: In this paper we present a tool for hierarchical layout verification. Design rule check and netlist extraction can be performed within one program run. This allows to verify more complex rules than with separated tools avoids redundant work. To improve verification, the preserves original hierarchy: Each cell in is checked only once then replaced by an abstract, containing all information needed against its environment on next higher level. The does not require restrictions concerning style, however implemented basic algorithm modified user instructions adapt it special design style thereby increasing efficiency.