• DocumentCode
    999559
  • Title

    Magic´s Circuit Extractor

  • Author

    Scott, Walter S. ; Ousterhout, John K.

  • Author_Institution
    University of California, Berkeley
  • Volume
    3
  • Issue
    1
  • fYear
    1986
  • Firstpage
    24
  • Lastpage
    34
  • Abstract
    This fast hierarchical circuit extractor for the Magic VLSI layout system derives its speed from its ability to handle hiearchical arrays, and from a new algorithm based on corner-stitching, a geometrical data structure for representing Manhattan shapes. Corner-stitching´s ability to find adjacent mask information is critical to the basic extractor speed, and its ability to search areas makes the hiearchical extraction algorithm practical. The extractor is incremental, necessitating re-extraction of only a few cells after a layout is modified. It accepts a hierarchical layout that may contain nearly arbitrary overlaps between cells, and produces a circuit description with the same hierarchical structure as the layout. The extractor can completely extract a 37,000-transistor chip in 20 minutes of VAX CPU time, or incremetally in an average of 8 minutes. The extractor processes 50-65 FETS per second on a VAX-11/780 running Unix. if only substrate capacitance is being extracted. If coupling capacitance is also extracted, the basic extractor processes 25-35 transistors per second.
  • Keywords
    Circuit analysis; Circuit simulation; Circuit testing; Data mining; Data structures; Discrete event simulation; Geometry; Parasitic capacitance; Timing; Very large scale integration;
  • fLanguage
    English
  • Journal_Title
    Design & Test of Computers, IEEE
  • Publisher
    ieee
  • ISSN
    0740-7475
  • Type

    jour

  • DOI
    10.1109/MDT.1986.294914
  • Filename
    4069725