An extended representation of Q-sequence for optimizing channel-adjacency and routing-cost

Authors:
Changwen Zhuang;Keishi Sakanushi;Liyan Jin;Yoji Kajitani
Affiliations:
SII EDA Technologies Inc., Kitakyushu, Fukuoka;Osaka University, Osaka;Tokyo Inst. of Technol., Tokyo;Univ. of Kitakyushu, Kitakyushu, Fukuoka
Venue:
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Year:
2003

Citing 6
Cited 1

An O-tree representation of non-slicing floorplan and its applications

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits.

DAC '84 Proceedings of the 21st Design Automation Conference
An Enhanced Q-Sequence Augmented with Empty-Room-Insertion and Parenthesis Trees

Proceedings of the conference on Design, automation and test in Europe
VLSI module placement based on rectangle-packing by the 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
Slicing floorplans with boundary constraints

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

A (4n - 4)-Bit Representation of a Rectangular Drawing or Floorplan

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper proposes a topological representation for general floorplan, called the H-sequence, which can check channel-adjacency and boundary-adjacency in a constant time. Moreover, we define Routing-cost for the placement to measure its routing difficulty. Experimental results indicate that H-sequence based placement algorithm can optimize routing-cost effectively in a short time.