Prove that the following iterative algorithm computes the minimum unfolding factor for a nonrecursive DFG such that the iteration period of T is achievable. It is assumed that pipelining and/or retiming are not used to reduce the critical path.
Repeat until Tcrit ≤ JT
Fig 5.19 (a) The DFG in Fig. 5.16 redrawn so it is compatible with the unfolding ...