A NEW RETIMING ALGORITHM FOR CYCLE-TIME MINIMIZATION IN SYNCHRONOUS LOGIC SYNTHESIS

摘要

A new retiming algorithm for cycle-time minimization is given in this paper. In this algorithm,it is proved that the existence of a feasible retiming transformation can be computed in O(|E | * (num_ele + num_ver)) time for general synchronous Boolean networks.