• DocumentCode
    3141854
  • Title

    An O (N log N) Algorithm for Boolean Mask Operations

  • Author

    Lauther, Ulrich

  • Author_Institution
    SIEMENS AG, Munich, FRG
  • fYear
    1981
  • fDate
    29-1 June 1981
  • Firstpage
    555
  • Lastpage
    562
  • Abstract
    A new algorithm is presented which calculates Boolean combinations (AND, OR, EXOR, AND NOT) between two layers of an integrated circuit layout. Input and output of the algorithm is an edgebased description of the set of polygons which represent the artwork. The algorithm has O (N log N) time and PI Left column, top. space complexity, i.e. it is faster than previously published methods. Moreover, we believe that it is easier to understand and to implement than the previously leading method in the field.
  • Keywords
    Application software; Application specific integrated circuits; Computational modeling; Computer peripherals; Costs; Design methodology; Hardware; Integrated circuit layout; Runtime; Stress;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation, 1981. 18th Conference on
  • Type

    conf

  • DOI
    10.1109/DAC.1981.1585410
  • Filename
    1585410
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3141854