Data-flow transformations for critical path time reduction in high-level DSP synthesis

Abstract

The minimum unfolding factor necessary to reduce the critical path time of the data-flow graph to less than or equal to the required iteration period of the associated algorithm is determined. Minimizing the unfolding factor is important because the time complexity for scheduling and allocation increases linearly with the unfolding factor. An iterative unfolding algorithm that calculates the minimum unfolding factor necessary to achieve a given sample rate is introduced. The unfolding factor can be further reduced to achieve a given sample rate, in many cases with the use of retiming. The algorithm can be utilized to preprocess a data-flow graph prior to resource scheduling and allocation. >