The complexity of generalized retiming problems


We discuss the complexity of a number of high-level synthesis problems that can be viewed as generalizations of the classical retiming problem introduced by Leiserson and Saxe. The generalizations are concerned with additional degrees of freedom resulting from timefolding and multiplexing. The central problem is the design of multicycle and multifunctional… (More)
DOI: 10.1109/43.543767


6 Figures and Tables

Slides referencing similar topics