Automatic floorplan design

Otten, Ralph H. J. M.

doi:10.1145/800263.809216

Cited by 102 publications

(66 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Using standard slicing techniques [21], the layout is partitioned in rectilinear areas encompassing exactly one atomic block. The complexity of this operation is O(|Ω| log|Ω|) where |Ω| is the number of objects in the layout.…”

Section: Watermarking Physical Implementationsmentioning

confidence: 99%

Watermarking Techniques for Electronic Circuit Design

Charbon

Torunoglu²

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Section: Watermarking Physical Implementationsmentioning

confidence: 99%

Watermarking Techniques for Electronic Circuit Design

Charbon

Torunoglu²

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Many floorplan representations have been proposed [5,9,14,15,16,18,19,20,22] in the literature. However, traditional floorplanning/placement algorithms do not scale well as the design size, complexity, and constraints increase, mainly due to their inflexibility in handling non-slicing floorplans, and/or intrinsically non-hierarchical data structures (representations).…”

Section: Introductionmentioning

confidence: 99%

Multilevel floorplanning/placement for large-scale modules using B*-trees

Lee¹,

Chang

Hsu

et al. 2003

Proceedings of the 40th Annual Design Automation Conference

View full text Add to dashboard Cite

We present in this paper a multilevel floorplanning/placement framework based on the B*-tree representation, called MB*-tree, to handle the floorplanning and packing for large-scale building modules. The MB*-tree adopts a two-stage technique, clustering followed by declustering. The clustering stage iteratively groups a set of modules based on a cost metric guided by area utilization and module connectivity, and at the same time establishes the geometric relations for the newly clustered modules by constructing a corresponding B*-tree for them. The declustering stage iteratively ungroups a set of the previously clustered modules (i.e., perform tree expansion) and then refines the floorplanning/placement solution by using a simulated annealing scheme. In particular, the MB*-tree preserves the geometric relations among modules during declustering, which makes the MB*-tree an ideal data structure for the multilevel floorplanning/placement framework. Experimental results show that the MB*-tree obtains significantly better silicon area and wirelength than previous works. Further, unlike previous works, MB*-tree scales very well as the circuit size increases.

show abstract

“…There exist a few floorplan representations in the literature, e.g., [1], [2], [3], [7], [8], [9], [10], [11], [12], [13], [17], [18]. We shall first review these representations and the types of floorplans that they can represent.…”

Section: A Previous Workmentioning

confidence: 99%

“…A slicing structure can be obtained by recursively cutting rectangles horizontally or vertically into smaller rectangles; it is a non-slicing structure, otherwise. Otten first proposed a binary-tree representation for slicing floorplans [11]. Wong and Liu later in [18] presented a normalManuscript received Sep 7, 2002;revised Feb 28, 2003.…”

Section: A Previous Workmentioning

confidence: 99%

TCG: a transitive closure graph-based representation for non-slicing floorplans

Lin¹,

Chang²

Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232)

View full text Add to dashboard Cite

Abstract-In this paper, we introduce the concept of the P*-admissible representation and propose a P*-admissible, transitive closure graph-based representation for general floorplans, called TCG, and show its superior properties. TCG combines the advantages of popular representations such as sequence pair, BSG, and B*-tree. Like sequence pair and BSG, but unlike O-tree, B*-tree, and CBL, TCG is P*-admissible. Like B*-tree, but unlike sequence pair, BSG, O-tree, and CBL, TCG does not need to construct additional constraint graphs for the cost evaluation during packing, implying faster runtime. Further, TCG supports incremental update during operations and keeps the information of boundary modules as well as the shapes and the relative positions of modules in the representation. More importantly, the geometric relation among modules is transparent not only to the TCG representation but also to its operations, facilitating the convergence to a desired solution. All these properties make TCG an effective and flexible representation for handling the general floorplan/placement design problems with various constraints. Experimental results show the promise of TCG.

show abstract

Automatic floorplan design

Cited by 102 publications

References 0 publications

Watermarking Techniques for Electronic Circuit Design

Watermarking Techniques for Electronic Circuit Design

Multilevel floorplanning/placement for large-scale modules using B*-trees

TCG: a transitive closure graph-based representation for non-slicing floorplans

Contact Info

Product

Resources

About