Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Introduction to VLSI Systems
Hierarchical circuit extraction with detailed parasitic capacitance
DAC '83 Proceedings of the 20th Design Automation Conference
DAC '83 Proceedings of the 20th Design Automation Conference
DAC '81 Proceedings of the 18th Design Automation Conference
An O (N log N) algorithm for Boolean mask operations
DAC '81 Proceedings of the 18th Design Automation Conference
A solution to line-routing problems on the continuous plane
DAC '69 Proceedings of the 6th annual Design Automation Conference
An artwork design verification system
DAC '75 Proceedings of the 12th Design Automation Conference
Fast algorithms for LSI artwork analysis
DAC '77 Proceedings of the 14th Design Automation Conference
The quad-CIF tree: A data structure for hierarchical on-line algorithms
DAC '82 Proceedings of the 19th Design Automation Conference
A symbolic design system for integrated circuits
DAC '82 Proceedings of the 19th Design Automation Conference
Compaction and Circuit Extraction in the MAGIC IC Layout System
Compaction and Circuit Extraction in the MAGIC IC Layout System
Automatic tub region generation for symbolic layout compaction
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Resistance extraction and resistance calculation in GOALIE?
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Hi-index | 0.00 |
A new tool called a circuit disassembler has been developed to transform a mask level layout into an equivalent symbolic layout. This technique has been implemented in the program called KAHLUA that can handle mask layout containing arbitrary Manhattan geometry and is independent of the circuit technology. Circuits designed using physical layout systems can be automatically disassembled into a symbolic environment. Once converted, the disassembled cells can be manipulated further by any existing symbolic design or verification tools. In particular, these cells can be automatically remapped for a new technology. Our formulation of the problem consists of two major stages: device extraction, and net decomposition. In the first stage the transistors and contacts are extracted from the layout to form leaf cells. In the second stage a set of symbolic wires is derived from the remaining interconnect geometry. KAHLUA has been tested on a wide range of physical cells and has produced high quality results with modest execution times. An additional feature of the technique include the ability to disassemble hierarchically, which makes disassembling large layouts feasible.