Efficient retiming and unfolding

Data-flow graphs (DFGs) can be used to represent a signal-flow graph, a synchronous system or digital circuitry. Retiming and unfolding are two useful techniques which have been effectively applied to optimize the realization of DFGs. The retiming technique reorganizes an iteration; the unfolding technique schedules several iterations together. These two techniques can be combined to schedule DFGs optimally. The authors present a very efficient algorithm to combine these two techniques. They also present simple methods for examining an unfolded graph by simulating it on the original DFG.<>