Abstract
We present optimal linear time algorithms that determine whether a given general floorplan represented by a q-sequence or twin binary trees is slicing or hierarchical. Experimental results on several benchmarks are presented.
VLSI Design, International Conference on
Like what you’re reading?
Already a member?
Related Articles
- Efficient approximation algorithms for floorplan area minimization
Design Automation Conference - Automatic Floorplan Design
19th Design Automation Conference - Critical problems for a slicing floorplan
2017 Computer Science and Information Technologies (CSIT) - Slicing floorplan with clustering constraints
Proceedings of the ASP-DAC 2001. Asia and South Pacific Design Automation Conference 2001 - Efficient Floorplan Area Optimization
26th ACM/IEEE Design Automation Conference - Slicing Tree Is a Complete Floorplan Representation
Design, Automation & Test in Europe Conference & Exhibition - Corner Block List: An Effective and Efficient Topological Representation of Non-Slicing Floorplan
Computer-Aided Design, International Conference on - Parallel algorithms for slicing floorplan designs
Parallel and Distributed Processing, IEEE Symposium on - An integrated algorithm for optimal floorplan sizing and enumeration
1993 European Conference on Design Automation with the European Event in ASIC Design - GPE: A New Representation for VLSI Floorplan Problem
Proceedings. IEEE International Conference on Computer Design: VLSI in Computers and Processors