Skip to Main Content
Efficient algorithms for the automatic insertion of flip-flops and buffers are presented. The algorithms have been implemented as pan of an automatic repeater insertion tool. The algorithms use a dynamic programming framework to build viable solution pairs and then pick the most optimal solution at the driver. Pruning rules to limit the size of the solution space are also presented.