Estimating the storage requirements of the rectangular and L-shaped corner stitching data structures

Authors:
Dinesh P. Mehta
Affiliations:
Univ. of Tennessee Space Institute, Tullahoma
Venue:
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Year:
1998

Citing 2
Cited 0

Magic: A VLSI layout system

DAC '84 Proceedings of the 21st Design Automation Conference
Corner stitching for simple rectilinear shapes [VLSI layouts]

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a technique for estimating the storage requirements of the Rectangular Corner Stitching (RCS) data structure [Ousterhout 1984] and the L-shaped Corner Stitching (LCS) data structure [Mehta and Blust 1997] on a given circuit by studying its (the circuit's) geometric properties. This provides a method for estimating the storage requirements of a circuit without having to implement the corner stitching data structure, which is a tedious and time-consuming task. This technique can also be used to estimate the amount of space saved by employing the LCS data structure over the RCS data structure on a given circuit.