We present a theorem which characterizes all feasible retimings for a strongly-connected graph. For such graphs, we give necessary and sufficient conditions for the achievability of a chosen target retiming. We describe an application which combines floorplanning and retiming which utilizes this characterization. Experimental results show our techniques yield superior clock frequencies with a minor increase in wirelength
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.