An O (N log N) algorithm for Boolean mask operations

Proceedings - Design Automation Conference

Volumn , Issue , 1981, Pages 555-562

  Lauther, Ulrich ^a  

^a SIEMENS AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN COMBINATIONS; EDGE-BASED; INPUT AND OUTPUTS; MASK OPERATION; SPACE COMPLEXITY;

COMPUTER AIDED DESIGN; INTEGRATED CIRCUITS;

EID: 85040271535     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/dac.1981.1585410     Document Type: Conference Paper

References (17)

1. B. W. Lindsay, B. T. Preas: "Design Rule Checking and Analysis of IC Mask Designs", Proc. 13th DA Conf., San Francisco, June 1976, pp. 301-308
2. I. Dobes, R. Byrd: "The Automatic Recognition of Silicon Gate Transistor Geometries: An LSI Design Aid Program", Proc. 13th DA Conf., San Francisco, June 1976, pp. 327-335
3. U. S. Baird: "Fast Algorithms for LSI Artwork Analysis", Proc. 14th DA Conf., New Orleans, June 1977, pp. 303-311
4. U. S. Baird: "Design of a Family of Algorithms for Large Scale Integrated Circuit Mask Artwork Analysis", M. S. Thesis, Dept. of Computer Sience, Rutgers University, New Brunswick, New Jersey, May 1976
5. C. S. Chang: "LSI Layout Checking Using Bipolar Device Recognition Technique", Proc. 16th DA Conf., June 1979, San Diego, pp. 95-101
6. P. Losleben, K. Thompson: "Topological Analysis for VLSI Circuits" Proc. 16th DA Conf., June 1979, San Diego, pp. 461-473
7. J. A. Wilmore: "A Hierarchical Bit-Map Format For The Representation of IC Mask Data", Proc. 17th DA Conf., June 1980, Minneapolis, pp. 585-590
8. U. Lauther: "Simple But Fast Algorthms For Connectivity Extraction and Comparison in Cell Based VLSI Designs", Proc. ECCTD 80, September 1980, Warsaw, pp. 508-514
9. M. Yamin: "Derivation of All Figures Formed by the Intersection of Generalized Polygons", The Bell System Technical Journal, Vol. 51, No. 7, Sept. 1972, pp. 1595-1610
10. L. Szanto: "Network Recognition of a MOS Integrated Circuit from its Masks", Tesla electronics, 9(1976), pp. 67-75
11. I. Shamos, D. Hoey: "Geometric Intersection Problems", Proc, 17th Ann. Conf. Foundations of Computer Science, Oct. 1976, pp. 208-215
12. J. L. Bentley, T. A. Ottmann: "Algorithms for Reporting and Counting Geometric Intersections", IEEE Trans. Comp; Vol. 6-28, No. 9, Sept. 1979, pp. 643-647
13. D. Alexander: "A Technology Independent Design Rule Checker", NCA Corporation, 383 Oakmead Parkway, Sunnyvale, Cal.
14. T. Blank: "A Bit Map Processing Maschine Architecture", IEEE DA Workshop, Lansing, Oct. 1980
15. D. E. Knuth: "The Art of Computer Programming Vol 3: Sorting and Searching" Reading, MA: Addison-Wesley, 1973
16. A. V. Aho, J. E. Hopcroft, S. D. Ullmann: "The Design and Analysis of Computer Algorithms", Reading, MA: Addison-Wesley, 1975
17. C. A. Crane: "Linear lists and priority queues as balanced binary trees", Ph. D. Thesis, Stanford University, 1972