ACG-Adjacent Constraint Graph for general floorplans

Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors

Volumn , Issue , 2004, Pages 572-575

  Zhou, Hai ^a   Wang, Jia ^a  

^a NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENT CONSTRAINT GRAPH (ACG); FLOORPLAN DESIGN; FLOORPLANNING;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FLOORS; PERTURBATION TECHNIQUES; SIMULATED ANNEALING;

GRAPH THEORY;

EID: 17644378125     PISSN: 10636404     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCD.2004.1347980     Document Type: Conference Paper

References (15)

1. S.N. Adya and I.L. Markov. Fixed-outline floorplanning: Enabling hierarchical design. IEEE Trans. on VLSI Systems, 11(6):1120-1135, December 2003.
2. J. Bhasker and S. Sahni. A linear algorithm to find a rectangular dual of a planar triangulated graph. In DAC, pages 108-114, 1986.
3. Y.-C. Chang, Y.-W. Chang, G.-M. Wu, and S.-W. Wu. B*-trees: A new representation for non-slicing floorplans. In DAC, pages 458-463, 2000.
4. J. Grason. A Dual Linear Graph Representation for Space-Filling Location Problems of the Floor-planning Type. MIT Press, Cambridge, MA, 1970.
5. P.-N. Guo, C.-K. Cheng, and T. Yoshimura. An O-tree representation of non-slicing floorplan and its applications. In DAC, pages 268-273, 1999.
6. X. Hong, G. Huang, Y. Cai, J. Gu, S. Dong, C.-K. Cheng, and J. Gu. Corner block list: An effective and efficient topological representation of non-slicing floorplan. In ICCAD, pages 8-12, 2000.
7. K. Kozminski and E. Kinnen. Rectangular dual of planar graphs. Networks, 15:145-157, 1985.
8. Y. T. Lai and S. M. Leinwand. Algorithms for floor-plan design via rectangular dualization. IEEE TCAD, 7(12):1278-1289, 1988.
9. J.-M. Lin and Y.-W. Chang. TCG: A transitive closure graph-based representation for non-slicing floorplans. In DAC, pages 764-769, 2001.
10. J.-M. Lin and Y.-W. Chang. Tcg-s: Orthogonal coupling of p*-admissible representation for general floorplans. In DAC, pages 842-847, New Orleans, LA, June 2002.
11. H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani. Rectangle-packing based module placement. In ICCAD, pages 472-479, 1995.
12. S. Nakatake, K. Fujiyoshi, H. Murata, and Y. Kajitani. Module placement on BSG-structure and IC layout applications. In ICCAD, pages 484-493, 1996.
13. X. Tang and D. F. Wong. FAST-SP: A fast algorithm for block placement based on sequence pair. In ASP-DAC, pages 521-526, 2001.
14. G. Yeap and M. Sarrafzadeh. Floorplanning by graph dualization: 2-concave rectilinear modules. Manuscripts, 1993.
15. F. Y. Young, C. C. N. Chu, and Z. C. Shen. Twin binary sequences: A non-redundant representation for general non-slicing floorplan. IEEE TCAD, 22(4):457-469, April 2003.