Skip to main content
Article thumbnail
Location of Repository

Characterization of Feasible Retimings

By et al. Philip Chong

Abstract

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

Year: 2001
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.868
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cadence.com/company... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.