Rectilinear block packing using O-tree representation

Proceedings of the International Symposium on Physical Design

Volumn , Issue , 2001, Pages 156-161

  Pang, Y ^a   Cheng, C K ^a   Lampaert, K ^a   Xie, W ^a  

^a Mindspeed Technologies   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; TREES (MATHEMATICS); VLSI CIRCUITS;

RECTILINEAR SHAPED MODULES;

COMPUTATIONAL GEOMETRY;

EID: 0034819171     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/369691.369758     Document Type: Conference Paper

References (10)

1. Arbitrary convex and concave rectilinear block packing using sequence-pair
2. Rectilinear block placement using sequence-pair
3. An O-tree representation of non-slicing floorplan and its applications
4. General floorplanning with L-shaped, T-shaped and soft blocks based on bounded slicing grid structure
5. Arbitrary rectilinear block-packing based on sequence pair
6. VLSI module placement based on rectangle-packing by the sequence-pair
7. Module packing based on the BSG-structure and IC layout applications
8. The multi-BSG: Stochastic approach to an optimum packing of convex-rectilinear blocks
9. An enhanced perturbing algorithm for floorplan designusing the O-tree representation
10. Floorplan design for rectangular and L-shaped modules