Rectilinear block packing using O-tree representation

Pang, Yingxin; Cheng, Chung‐Kuan; Lampaert, Koen; Xie, Weize

doi:10.1145/369691.369758

Cited by 25 publications

(17 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Unlike the work in [10], most previous work partitioned a rectilinear module into a set of rectangular submodules and operated on the submodules under some constraints induced from the original rectilinear module. There are a few existing partition based approaches using well-known representations: for example, bounded-sliceline grid (BSG) [5], [7], [16], sequence pair [2], [6], [21], -tree [20], -tree [18], and corner block list (CBL) [13].…”

Section: A Previous Workmentioning

confidence: 99%

“…Each -tree is encoded by a pair of strings, denoting the DFS traversal order of the tree. Pang et al recently in [18] used the -tree representation to handle rectilinear modules. The packing scheme has relatively lower time complexity, but the overall approach is less flexible and more restricted.…”

Section: A Previous Workmentioning

confidence: 99%

“…will be divided into two pieces because and are inserted between and simultaneously, and is larger than . As in [18] and [22], this can be resolved by expanding to connect with because it does not cause problems for some practical applications but waste some silicon areas.…”

Section: (A)-(d) [(E)-(h)] the Corresponding Tcg Is Illustrated Inmentioning

confidence: 99%

See 2 more Smart Citations

Arbitrarily shaped rectilinear module placement using the transitive closure graph representation

Lin

Chen²,

Chang

2002

IEEE Trans. VLSI Syst.

View full text Add to dashboard Cite

Abstract-In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transparent to TCG as well as its induced operations, which makes TCG an ideal representation for floorplanning/placement with arbitrary rectilinear modules. We first partition a rectilinear module into a set of submodules and then derive necessary and sufficient conditions of feasible TCG for the submodules. Unlike most previous works that process each submodule individually and thus need to perform post processing to fix deformed rectilinear modules, our algorithm treats a set of submodules as a whole and thus not only can guarantee the feasibility of each perturbed solution but also can eliminate the need for the postprocessing on deformed modules, implying better solution quality and running time. Experimental results show that our TCG-based algorithm is capable of handling very complex instances; further, it is very efficient and results in better area utilization than previous work.

show abstract

Section: A Previous Workmentioning

confidence: 99%

Section: A Previous Workmentioning

confidence: 99%

See 1 more Smart Citation

Arbitrarily shaped rectilinear module placement using the transitive closure graph representation

Lin

Chen²,

Chang

2002

IEEE Trans. VLSI Syst.

View full text Add to dashboard Cite

show abstract

“…There are a few existing partition based approaches using well-known representations: BSG [2,4,11], sequence pair [1,3,16], B*-tree [15], O-tree [13], and CBL [9].…”

Section: Previous Workmentioning

confidence: 99%

“…Besides, they need a post-processing to adjust submodules to maintain the shapes of rectilinear modules. Pang et al [13] extended the O-tree representation to handle rectilinear modules. Recently, Ma et al [9] used CBL to deal with the placement abutment constraint and extended the method to deal with L/T-shaped modules.…”

Section: Previous Workmentioning

confidence: 99%

Arbitrary convex and concave rectilinear module packing using TCG

Lin¹,

Chen²,

Chang³

Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition

View full text Add to dashboard Cite

In this paper, we deal with arbitrary convex and concave rectilinear module packing using the Transitive Closure Graph (TCG) representation. The geometric meanings of modules are transparent to TCG and its induced operations, which makes TCG an ideal representation for floorplanning/placement with arbitrary rectilinear modules. We first partition a rectilinear module into a set of submodules and then derive necessary and sufficient conditions of feasible TCG for the submodules. Unlike most previous works that process each submodule individually and thus need post processing to fix deformed rectilinear modules, our algorithm treats a set of submodules as a whole and thus not only can guarantee the feasibility of each perturbed solution but also can eliminate the need of the post processing on deformed modules, implying better solution quality and running time. Experimental results show that our TCG-based algorithm is capable of handling very complex instances; further, it is very efficient and results in better area utilization than previous work.

show abstract

Performance Driven VLSI Floorplanning with B*Tree Representation Using Differential Evolutionary Algorithm

Rani¹,

Rajaram²

2011

Trends in Network and Communications

View full text Add to dashboard Cite

Rectilinear block packing using O-tree representation

Cited by 25 publications

References 8 publications

Arbitrarily shaped rectilinear module placement using the transitive closure graph representation

Arbitrarily shaped rectilinear module placement using the transitive closure graph representation

Arbitrary convex and concave rectilinear module packing using TCG

Performance Driven VLSI Floorplanning with B*Tree Representation Using Differential Evolutionary Algorithm

Contact Info

Product

Resources

About