Floorplanning with abutment constraints and L-shaped/T-shaped blocks based on corner block list

Proceedings - Design Automation Conference

Volumn , Issue , 2001, Pages 770-775

  Ma, Y ^a   Hong, X ^a   Dong, S ^a   Cai, Y ^a   Cheng, C K ^a   Gu, J ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; HEURISTIC METHODS; SCANNING; SIMULATED ANNEALING; TIME VARYING NETWORKS;

NON-SLICING FLOORPLANS;

DATA TRANSFER;

EID: 0034852169     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. VLSI block placement based on rectangle-packing by the sequence pair
2. Block placement on BSG-structure and IC layout application
3. An O-tree representation of non-slicing floorplan and its applications
4. B*-Trees: A new representation for non-slicing floorplans
5. Corner block list: An effective and efficient topological representation of non-slicing floorplan
6. General floorplanning with L-shaped, T- shaped and soft blocks based on bounded slicing grid structure
7. On extending slicing floorplans to handle L/T-shaped blocks and abutment constraints
8. VLSI floorplanning with boundary constraints based on corner block list
9. Arbitrary convex and concave rectilinear block packing using sequence-pair