A new approach to the VLSI layout problem is proposed that produces a structured floor plan for an arbitrary network of interconnected processing elements. It is based on extracting a minimum spanning tree from a given representation of a computation network and using an efficient, structured layout scheme for this minimum spanning tree. Techniques to lay out trees as arrays of layout slices are presented. It is assumed that the nodes of a network are identical in their layout size and connectivity. This method is valid at any level of a VLSI design since these nodes may represent gates, cells or complex macros. An application of this approach to modified tree networks is described. Other useful applications of the method are mentioned
AbstractPlacement algorithms for VLSI layout tend to stick the building blocks together. This result...
A methodology of VLSI layout described by several authors first determines the relative positions of...
Because of the increasing complexity of the designs, there is a great necessity for automatic layout...
A new approach to the VLSI layout problem is proposed that produces a structured floor plan for an a...
This thesis presents the development of a layout automator for VLSI circuit design using a standard ...
162 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987.The thesis addresses the algo...
AbstractA new divide-and-conquer framework for VLSI graph layout is introduced. Universally close up...
126 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.This thesis considers several...
The problem of automatic layout synthesis is addressed. Given a description of the cell circuit to b...
This paper defines a new sliced layout architecture for compilation of arbitrary schematics (netlist...
As VLSI circuits become larger and more complex, the need to improve design automation tools becomes...
The subject of this paper is an algorithm generating topological layouts for VLSI-circuits that are ...
129 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987.In this thesis, a systematic ...
Floor-planning is a fundamental step in VLSI chip design. Based upon the concept of orderly spannin...
The first stage in hierarchical approaches to floorplan design determines certain topological relati...
AbstractPlacement algorithms for VLSI layout tend to stick the building blocks together. This result...
A methodology of VLSI layout described by several authors first determines the relative positions of...
Because of the increasing complexity of the designs, there is a great necessity for automatic layout...
A new approach to the VLSI layout problem is proposed that produces a structured floor plan for an a...
This thesis presents the development of a layout automator for VLSI circuit design using a standard ...
162 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987.The thesis addresses the algo...
AbstractA new divide-and-conquer framework for VLSI graph layout is introduced. Universally close up...
126 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.This thesis considers several...
The problem of automatic layout synthesis is addressed. Given a description of the cell circuit to b...
This paper defines a new sliced layout architecture for compilation of arbitrary schematics (netlist...
As VLSI circuits become larger and more complex, the need to improve design automation tools becomes...
The subject of this paper is an algorithm generating topological layouts for VLSI-circuits that are ...
129 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987.In this thesis, a systematic ...
Floor-planning is a fundamental step in VLSI chip design. Based upon the concept of orderly spannin...
The first stage in hierarchical approaches to floorplan design determines certain topological relati...
AbstractPlacement algorithms for VLSI layout tend to stick the building blocks together. This result...
A methodology of VLSI layout described by several authors first determines the relative positions of...
Because of the increasing complexity of the designs, there is a great necessity for automatic layout...
Add to ORKG