Determination of the minimum latency in loop folding

In loop folding, to find the minimum latency is NP-complete if one formulates it as a cyclic graph problem. In this paper, a new method is proposed which gives a linear time performance. The example of a second order IIR filter is considered.