An Enhanced Q-Sequence Augmented with Empty-Room-Insertion and Parenthesis Trees

After the discussion on the difference between floorplanning and packing in VLSI placement design, this paper adapts the floorplanner that is based on the Q-sequence to a packing algorithm. For the purpose, some empty room insertionis required to guarantee not to miss the optimum packing. To increase the performance in packing, a new move that perturbs the floorplan is introduced in terms of the ParenthesisTree Pair. A Simulated Anealing based packing search algorithm was implemented. Experimental results showed the effect of empty room insertion.

• Type: Conference
• Year: 2002
• Where: DATE
• Authors: Changwen Zhuang, Yoji Kajitani, Keishi Sakanushi, Liyan Jin
• Keywords: DATE 2002, Hardware, Optimum Packing, Packing Algorithm, Packing Search Algorithm