Consistent floorplanning with super hierarchical constraints

Authors:
Shigetoshi Nakatake;Yukiko Kubo;Yoji Kajitani
Affiliations:
The University of Kitakyushu, 1-1 Hibikino, Wakamatsu-ku, The City of Kitakyushu, Fukuoka, 808-0135, Japan;The University of Kitakyushu, 1-1 Hibikino, Wakamatsu-ku, The City of Kitakyushu, Fukuoka, 808-0135, Japan;The University of Kitakyushu, 1-1 Hibikino, Wakamatsu-ku, The City of Kitakyushu, Fukuoka, 808-0135, Japan
Venue:
Proceedings of the 2001 international symposium on Physical design
Year:
2001

Citing 7
Cited 1

Clock routing for high-performance ICs

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
An O-tree representation of non-slicing floorplan and its applications

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
VLSI floorplanning with boundary constraints based on corner block list

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
A class of min-cut placement algorithms

DAC '77 Proceedings of the 14th Design Automation Conference
VLSI module placement based on rectangle-packing by the sequence-pair

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
VLSI/PCB placement with obstacles based on sequence pair

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Module packing based on the BSG-structure and IC layout applications

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Practicality on placement given by optimality of packing

Proceedings of the 2013 ACM international symposium on International symposium on physical design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sequence-Pair based floorplanning has been revealed its limit of usefulness in VLSI physical design. Among reasons, the key issue is in its being non-hierarchical and indifferent to the preceding step of partitioning. This paper restructure the algorithm by the idea that the partition algorithm produces the constraint that is imposed on the sequence-pair data. The partition algorithm is the one based on the balanced-bipartition that works hierarchically. Thus a new floorplan algorithm that is consistent with the hierarchical partition algorithm is constructed. This is enhanced to include other algorithms that are based on the binary search. Here, a clock-tree synthesis by H-tree is shown to be consistent. Experiments are given to show better achievements in length and wire-density.