S. K. Nandy
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 search 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.
- 1.M.H. Arnold and J.K. Ousterhout, "LYRA: A New Approach to Geometric Layout Rule Checking", Proceedings of the 19th Design Automation Conference, 1982, pp. 530-536. Google Scholar
Digital Library
- 2.J.L. Bentley and D. Hakenj R.W. Hon, "Statistics on VLSI Designs", Department of Computer Science, CMU, CS-80-111~ April 1980.Google Scholar
- 3.G. Kedem, "A Data Structure for Hierarchical On-Line Algorithms", Proceedings of the 19th Design Automation Conference, 1982, pp. 352-357. Google ScholarDigital Library
- 4.G. Kedem and H. Watanabe, "Graph-Optimization Techniques for IC Layout and Compaction", IEEE Transactions on Computer-Aided Design, Vol. CAD-3, No.i, January 1984, pp. 12-20.Google Scholar
- 5.A. Klinger and C.R. Dyer, "Experiments in Picture Representations using Regular Decomposition", Computer Graphics and Image Processing, Vol. 5, No. 1, March 1976, pp. 68-105.Google ScholarCross Ref
- 6.S.K. Nandy and I.V. Ramakrishnan, "Dual Quadtree Representatic~ for VLSI Designs", Technical Report 85/27, Department of Computer Science, State University of New York at Stony Brook, December 1985.Google Scholar
- 7.J.K. Ousterhout, G.T. Hamaehi, R.N. Mayo, W.S. Scott and G.S. Taylor, "Magic: A VLSI Layout, System", Proceedings of the elst Design Automation Conference, 1984, pp. 152-159. Google ScholarDigital Library
- 8.J.K. Ousterhout, "Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools", IEEE Transactions on Computer.Aided Design, Vol. CAD-3, January 1984, pp. 87-100.Google Scholar
- 9.J.B. Rosenberg, "Geographical Data Structures Compared: A Study of Data Structures Supporting Region Queries" IEEE Transactions on Computer-A ided Design, ~rol. CAD-4, January 1985, pp. 53*67.Google Scholar
- 10.H. Samet, "An Algorithm for Converting Rasters to Quadtrees", {EEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-3, No.l, January 1981, pp. 93-95.Google ScholarDigital Library
- 11.H. Samet, "Region Representation: Boundary Codes from Quadtrees", Communications of the A CM~ Vol. 23, No.3, March 1980, pp. 171-179. Google ScholarDigital Library
- 12.H. Samet, "Region Representation: Quadtrees from Boundary codes", Communications of the A CM, Vol. 23, INo.3, March 1980, pp. 163-170. A CM Computing Surveys, Vol.16, No. 2, June 1984, pp. 187-260. Google ScholarDigital Library
- 13.N. Weste, "Virtual Grid Symbolic Layout"~ Proceedings of the 18th De~:ign Automation Conference, 1981, pp. 225-233. Google ScholarDigital Library
Index Terms
- Dual quadtree representation for VLSI designs
Recommendations
Delaunay/Voronoi Dual Representation of Smooth 2-Manifolds
CADGRAPHICS '11: Proceedings of the 2011 12th International Conference on Computer-Aided Design and Computer GraphicsDelaunay triangulation and Voronoi diagram are widely used in computer graphics, computational geometry and other fields. Different from the planar case, Delaunay triangulation of a point set on smooth 2-manifolds does not always exist. In this paper we ...
High-speed VLSI arithmetic processor architectures using hybrid number representation
Special issue: 1990 Workshop on VLSI signal processingThis paper addresses design of high speed architectures for fixed-point, two's-complement, bit-parallel division, square-root, and multiplication operations. These architectures make use of hybrid number representations (i.e. the input and output ...
Comments