Corner stitching for simple rectilinear shapes [VLSI layouts]

This paper extends the corner-stitching data structure proposed by Ousterhout (1984) for manipulating rectangular objects in very large scale integration (VLSI) layouts to L-shaped objects. This provides additional flexibility in the design of very large scale integration (VLSI) circuits. Our techni...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computer-aided design of integrated circuits and systems 1997-02, Vol.16 (2), p.186-198
Main Authors: Mehta, D.P., Blust, G.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Applied sciences
Circuit topology
Computer science
Data structures
Design automation
Design. Technologies. Operation analysis. Testing
Electronics
Exact sciences and technology
Flexible printed circuits
Integrated circuits
Routing
Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Shape
Tiles
Very large scale integration
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper extends the corner-stitching data structure proposed by Ousterhout (1984) for manipulating rectangular objects in very large scale integration (VLSI) layouts to L-shaped objects. This provides additional flexibility in the design of very large scale integration (VLSI) circuits. Our technique is fundamentally different from Ousterhout's and other extensions to the corner stitching data structure in that it modifies the underlying topology of the data structure. This gives rise to differences in the implementation of operations on the data structure. Our data structure is guaranteed to require less memory than the original data structure. Experiments show that our data structure required about 15%-17% less memory than the original data structure on VLSI layouts but was slower by a factor of two to eight. Extensions of corner stitching to T- and Z-shaped tiles are also described.
ISSN:0278-0070
1937-4151
DOI:10.1109/43.573833