Slicing tree has been an effective tool for VLSI floorplan de-sign. Floorplanners using slicing tree representation take full advantage of shape and orientation flexibility of circuit modules to find highly compact slicing floorplans. However, slicing floorplans are commonly believed to suffer from poor utilization of space when all modules are hard. For this rea-son, a large body of literature has recently been devoted to various new representations of non-slicing floorplans to im-prove space utilization. In this paper, we prove that by using slicing tree representation and compaction, all maximally compact placements of modules can be generated. In con-clusion, slicing tree is a complete floorplan representation for all non-slicing floorp...
Floorplan representation is a fundamental issue in designing a floorplanning algorithm. In this pape...
A methodology of VLSI layout described by several authors first determines the relative positions of...
The traditional algorithm of Stockmeyer for area minimization of slicing oorplans has time (and spa...
We present an ordered tree (O tree) structure to represent nonslicing floorplans. The O tree uses on...
The first stage in hierarchical approaches to floorplan design determines certain topological relati...
The building blocks in a given floor-plan may have several possible physical implementations yie1din...
[[abstract]]We consider in this paper the problem of slicing floorplan design with boundary-constrai...
This is a preliminary study in which we use a genetic algorithm to solve the multiple layer floorpla...
Abstract- In this paper, we address the problem of VLSI floorplanning with considering boundary cons...
Existing floorplanuers that use shcing floorplans are efficient in runtime and yet can pack modties ...
As the impact of interconnect on IC performance and chiparea in deep submicron design increases, res...
Abstract––In this paper, a corner block list — a new efficient topological representation for non-sl...
ABSTRACT: Floorplanning is the process to arranging the number of blocks in to boundary. Conventiona...
We present a genetic algorithm (GA) that uses a slicing tree construction process for the placement ...
129 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987.In this thesis, a systematic ...
Floorplan representation is a fundamental issue in designing a floorplanning algorithm. In this pape...
A methodology of VLSI layout described by several authors first determines the relative positions of...
The traditional algorithm of Stockmeyer for area minimization of slicing oorplans has time (and spa...
We present an ordered tree (O tree) structure to represent nonslicing floorplans. The O tree uses on...
The first stage in hierarchical approaches to floorplan design determines certain topological relati...
The building blocks in a given floor-plan may have several possible physical implementations yie1din...
[[abstract]]We consider in this paper the problem of slicing floorplan design with boundary-constrai...
This is a preliminary study in which we use a genetic algorithm to solve the multiple layer floorpla...
Abstract- In this paper, we address the problem of VLSI floorplanning with considering boundary cons...
Existing floorplanuers that use shcing floorplans are efficient in runtime and yet can pack modties ...
As the impact of interconnect on IC performance and chiparea in deep submicron design increases, res...
Abstract––In this paper, a corner block list — a new efficient topological representation for non-sl...
ABSTRACT: Floorplanning is the process to arranging the number of blocks in to boundary. Conventiona...
We present a genetic algorithm (GA) that uses a slicing tree construction process for the placement ...
129 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987.In this thesis, a systematic ...
Floorplan representation is a fundamental issue in designing a floorplanning algorithm. In this pape...
A methodology of VLSI layout described by several authors first determines the relative positions of...
The traditional algorithm of Stockmeyer for area minimization of slicing oorplans has time (and spa...