Combining Extended Retiming and Unfolding for Rate-Optimal. Graph Transformation. *. Timothy W. O'Neil Edwin H.-M. Sha. Dept. of Computer Science & Engineering.

Mar 1, 2005 · Two of the most popular are retiming and unfolding, which can be performed in tandem to achieve an optimal iteration period. However, the result ...

Abstract. Many computation-intensive iterative or recursive applications commonly found in digital signal pro- cessing and image processing applications can ...

There is no technique which can be combined with minimal unfolding to transform a DFG into one whose iteration period matches that of the optimal schedule ...

Extended retiming combines with unfolding, where multiple iterations are scheduled simultaneously, to achieve an optimal iteration period with minimal unfolding ...

Combining Extended Retiming and Unfolding for Rate-Optimal Graph Transformation by Timothy W. O'Neil, Edwin H.-M. Sha published in Journal of VLSI.

In our pre- vious work, we proposed a new technique, extended retiming, which can be combined with minimal unfolding to transform a DFG into one whose iteration ...

In this paper, we show how the computation time and code size of a pipelined nested loop is affected by execution sequence and retiming, assuming there is no ...

In our previous work, we proposed a new tech- nique, extended retiming, which can be combined with min- imal unfolding to transform a DFG into one which is rate ...

This paper proposes a new technique, extended retiming, which does just this. We construct the appropriate retiming functions and design an efficient retiming ...