A unified approach to floorplan sizing and enumeration

Given a sliceable floorplan and cell sizes, Otten and Stockmeyer (1983) presented an algorithm to find an optimal implementation for each cell. The authors consider a generalized optimal sizing problem on a set of slicing trees related to an adjacency graph. For computation efficiency, they combine...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computer-aided design of integrated circuits and systems 1993-12, Vol.12 (12), p.1858-1867
Main Authors: Yeap, G.K.-H., Sarrafzadeh, M.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Analog circuits
Cost function
Dynamic programming
Linear programming
Partitioning algorithms
Polynomials
Terminology
Tree graphs
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Given a sliceable floorplan and cell sizes, Otten and Stockmeyer (1983) presented an algorithm to find an optimal implementation for each cell. The authors consider a generalized optimal sizing problem on a set of slicing trees related to an adjacency graph. For computation efficiency, they combine the tree enumeration and sizing procedures in a unified algorithm where floorplan trees and sizes are computed simultaneously. The tree enumeration is based on adjacency graph of the input cells, which ensures that the adjacency requirements of the cells are preserved. Time complexity of the algorithm is analyzed and experimental results using MCNC benchmarks are reported.< >
ISSN:0278-0070
1937-4151
DOI:10.1109/43.251149