A new placement algorithm minimizing path delays

The author presents a new placement algorithm that minimizes path delays. The proposed algorithm first detects all paths and calculates path delays from the net list. It then improves the locations of flip-flops after random or initial placement. The locations of the terminals are then improved using the FDPR (force direct pairwise relaxation) method. Lastly, the locations of cells with fixed flip-flop locations are improved using the FDPR method again. Since this method controls the nets which constitute each path as a group, it can improve path delays better than methods which consider only the net length