Computer Aids for VLSI Design
Steven M. Rubin
Copyright © 1994

Chapter 3: Representation

Section 7 of 7

3.7 Summary

This chapter has discussed the representation of VLSI design. The first half of the chapter covered basic representational needs for any design task. The remainder of the chapter concentrated on the specific representations for circuitry: hierarchy, views, connectivity, and geometry. Implementation of a complete VLSI design database is complex but provides the necessary basis for the algorithms described in the rest of this book.


  1. When is the array a useful structure?
  2. Besides relieving the problem of fragmented memory, what is another advantage of clustering memory allocation into separate arenas?
  3. How could a pointer-based representation remain identical on disk and in memory?
  4. What is the disadvantage of having the database manage change control?
  5. To implement wires the ends of which do not extend beyond their connection point, some systems pull the connection points toward the center and then compute a normal wire that extends its ends by one-half of its width. What problems might this approach cause?
  6. Would sparse matrix representations work for VLSI geometry? Why or why not?
  7. How would you extend corner stitching to handle arbitrary angles?


Prev Previous     Contents Table of Contents     Next Next    
Steven M. Rubin
    Static Free Software SFS