Abstract
dc:description.abstractCompaction is the CAD tool used to pack rough sketches or symbolic diagrams to produce error free IC layouts. With the ever increasing complexity of VLSI circuitry, the building block approach becomes very important for custom VLSI design. A graph-theoretic compaction algorithm is developed for the compaction of symbolically specified layouts of building block LSI's. The layout area is reduced by minimizing the pitch in each dimension separately. The algorithm is capable of handling mixed constraints; i.e., the constraints arising from design rule requirements (lower-bound type), and the User defined constraints (equality and upper-bound type).
Degree
thesis:*- Name thesis:degree_name
- M.S.
- Level thesis:degree_level
- Masters
- Discipline thesis:degree_discipline
- Computer Science
- Grantor dc:publisher
- Texas Tech University
- Year dc:date.issued
- 1985
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Varadarajan, Ramachandran
Subjects
dc:subject × 4Rights
- Language dc:language.iso
- eng
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/2346/20518
- OAI identifier oai:identifier
- oai:ttu-ir.tdl.org:2346/20518