05/01/2000 09:00 AM
Computer Engineering
To the best of our knowledge, this is the first algorithm unifying arbitrary rectilinear block packing and soft block packing. Furthermore, this algorithm handles arbitrary convex or concave rectilinear block packing in the most efficient way compared to other sequence pair-based approaches. At the same time, the algorithm can handle rectangle soft block effectively. The concept of non-redundant constraint graph together with its algorithms play critical role in unifying the arbitrary rectilinear block packing and soft block packing. This general block packing tool builds the foundation for floorplanning with IP reuse. The experimental results demonstrate the efficiency and effectiveness of this general block packing.
