• DocumentCode
    3155796
  • Title

    Dual Quadtree Representation for VLSI Designs

  • Author

    Nandy, S.K. ; Ramakrishnan, I.V.

  • Author_Institution
    Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY
  • fYear
    1986
  • fDate
    29-2 June 1986
  • Firstpage
    663
  • Lastpage
    666
  • Abstract
    The Quad-CIF tree has been proposed as a data structure for hierarchical design of VLSI. Frequently encountered operations in VLSI design require a lot of serach effort on a Quad-CIF tree. Additionally, since the empty spaces are not explicitly stored in the tree, layout compaction is difficult to achieve. To support such operations efficiently, we propose a dual quadtree structure for VLSI design. At the first level we represent a cell in the layout as a "painted quadtree". The painted quadtree stores the entire region spanned by all the rectangles in the cell. Once the cell is designed it is stored in the form of boundary codes. At the second level of the dual structure, these boundary codes are stored in a Quad-CIF tree. Therefore, the dual structure affords us the convenience of using the painted quadtree for interactive design and the excellent features of the Quad-CIF tree for hierarchical design and compact storage representation.
  • Keywords
    Circuits; Compaction; Computer science; Data mining; Design automation; Fabrication; Layout; Tree data structures; Tree graphs; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation, 1986. 23rd Conference on
  • ISSN
    0738-100X
  • Print_ISBN
    0-8186-0702-5
  • Type

    conf

  • DOI
    10.1109/DAC.1986.1586160
  • Filename
    1586160