An Incremental Placement Algorithm for Building Block Layout Design Based on the O-Tree Representation
Summary :
Incremental modification and optimization in VLSI physical design is of fundamental importance. Based on the O-tree (ordered tree) representation which has more prominent advantages in comparison with other topological representations of non-slicing floorplans, in this paper, we present an incremental placement algorithm for BBL (Building Block Layout) design in VLSI physical design. The good performance of experimental results in dealing with some instances proves the effectiveness of our algorithm.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.12 pp.3398-3404
- Publication Date
- 2005/12/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietfec/e88-a.12.3398
- Type of Manuscript
- Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)
- Category
- Floorplan and Placement
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jing LI, Juebang YU, Hiroshi MIYASHITA, "An Incremental Placement Algorithm for Building Block Layout Design Based on the O-Tree Representation" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 12, pp. 3398-3404, December 2005, doi: 10.1093/ietfec/e88-a.12.3398.
Abstract: Incremental modification and optimization in VLSI physical design is of fundamental importance. Based on the O-tree (ordered tree) representation which has more prominent advantages in comparison with other topological representations of non-slicing floorplans, in this paper, we present an incremental placement algorithm for BBL (Building Block Layout) design in VLSI physical design. The good performance of experimental results in dealing with some instances proves the effectiveness of our algorithm.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.12.3398/_p
Copy
@ARTICLE{e88-a_12_3398,
author={Jing LI, Juebang YU, Hiroshi MIYASHITA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Incremental Placement Algorithm for Building Block Layout Design Based on the O-Tree Representation},
year={2005},
volume={E88-A},
number={12},
pages={3398-3404},
abstract={Incremental modification and optimization in VLSI physical design is of fundamental importance. Based on the O-tree (ordered tree) representation which has more prominent advantages in comparison with other topological representations of non-slicing floorplans, in this paper, we present an incremental placement algorithm for BBL (Building Block Layout) design in VLSI physical design. The good performance of experimental results in dealing with some instances proves the effectiveness of our algorithm.},
keywords={},
doi={10.1093/ietfec/e88-a.12.3398},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - An Incremental Placement Algorithm for Building Block Layout Design Based on the O-Tree Representation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3398
EP - 3404
AU - Jing LI
AU - Juebang YU
AU - Hiroshi MIYASHITA
PY - 2005
DO - 10.1093/ietfec/e88-a.12.3398
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2005
AB - Incremental modification and optimization in VLSI physical design is of fundamental importance. Based on the O-tree (ordered tree) representation which has more prominent advantages in comparison with other topological representations of non-slicing floorplans, in this paper, we present an incremental placement algorithm for BBL (Building Block Layout) design in VLSI physical design. The good performance of experimental results in dealing with some instances proves the effectiveness of our algorithm.
ER -
English
