On handling arbitrary rectilinear shape constraint

Non-rectangular (rectilinear) shape occurs very often in deep submicron floorplanning. Most previous algorithms are designed to handle only convex rectilinear blocks. However, handling concave rectilinear shape is necessary since a simple "U" shape is concave. A few works could address concave rectilinear block explicitly. In [2], a necessary and sufficient condition of feasible sequence pair is proposed for arbitrary rectilinear shape in terms of constraint graph. However, no constraint is imposed on sequence pair representation itself. The search for feasible sequence pair mainly depends on the simulated annealing, which implies unnecessary inefficiency. In many cases, it takes very long time or even is unable to find the feasible placement. Furthermore, it takes O

• Type: Conference
• Year: 2004
• Where: ASPDAC
• Authors: Xiaoping Tang, Martin D. F. Wong
• Keywords: ASPDAC 2004, Feasible Sequence Pair, Hardware, Rectilinear Shape, Sequence Pair