Efficient Boolean Operations on IC Masks
- 1 January 1981
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 571-579
- https://doi.org/10.1109/dac.1981.1585412
Abstract
Circuit extraction and design rule checking programs make extensive use of Boolean operations which accept IC mask data as operands. A wide variety of computer algorithms have been written that implement Boolean operations on sets of geometric entities. These algorithms vary in their efficiency and can be characterized by how they represent, sort, and compare IC artwork files. A bit-map representation of IC layout data precisely localizes mask information and eliminates the need for sorting the layout data prior to or during the performance of Boolean operations. The bit patterns of the mask operands may be compared using the CPU's own Boolean operators. A compacted bit-map format that can represent IC layouts concisely, therefore, provides an excellent data base for a very efficient algorithm to perform geometric Boolean operations.Keywords
This publication has 7 references indexed in Scilit:
- Computer aided synthesis of an IC electrical diagram from mask dataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A hierarchical bit-map format for the representation of IC mask dataPublished by Association for Computing Machinery (ACM) ,1980
- Unified Shapes Checker - A Checking Tool for LSIPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Topological Analysis for VLSI CircuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Design Rule Verification Based on One Dimensional ScansPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- A Color Graphics System for I.C. Mask Design and AnalysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- XYTOLR-A Computer Program for Integrated Circuit Mask Design CheckoutBell System Technical Journal, 1972