Modern Floorplanning with Boundary Clustering Constraint
暂无分享,去创建一个
Li Li | Yu Wang | Ning Xu | Xianlong Hong | Yuchun Ma | N. Xu | Yu Wang | Li Li | Yuchun Ma | Xianlong Hong
[1] Ting-Chi Wang,et al. Module placement with boundary constraints using the sequence-pair representation , 2001, ASP-DAC '01.
[2] Yao-Wen Chang,et al. MP-trees: A Packing-Based Macro Placement Algorithm for Mixed-Size Designs , 2007, 2007 44th ACM/IEEE Design Automation Conference.
[3] Takeshi Yoshimura,et al. An O-tree representation of non-slicing floorplan and its applications , 1999, DAC '99.
[4] Yao-Wen Chang,et al. TCG: a transitive closure graph-based representation for non-slicing floorplans , 2001, DAC '01.
[5] Yao-Wen Chang,et al. Module placement with boundary constraints using B*-trees , 2002 .
[6] Yici Cai,et al. Corner block list: an effective and efficient topological representation of non-slicing floorplan , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).
[7] Yoji Kajitani,et al. Module placement on BSG-structure and IC layout applications , 1996, ICCAD 1996.
[8] Yao-Wen Chang,et al. B*-trees: a new representation for non-slicing floorplans , 2000, Proceedings 37th Design Automation Conference.
[9] H. Murata,et al. Rectangle-packing-based module placement , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).
[10] Yici Cai,et al. VLSI floorplanning with boundary constraints based on corner block list , 2001, ASP-DAC '01.