Back to results

Texas Tech University

Algorithms for circuit layout compaction of building blocks

Abstract

dc:description.abstract

Compaction 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 × 4

Rights

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

Chain of custody

source
Harvested from
Texas Technology University
Base URL
ttu-ir.tdl.org/server/oai/request
Last updated
2026-07-24
Source record
OAI-PMH GetRecord
citation

Varadarajan, Ramachandran. Algorithms for circuit layout compaction of building blocks. Masters thesis, Texas Tech University, 1985. http://hdl.handle.net/2346/20518