- Unfold the DFG in Fig. 5.20 using unfolding factors 3 and 4.
- Unfold the DFGs in Fig. 5.21 using unfolding factors 2 and 5.
- Prove the relationship in (5.3) used to show that unfolding preserves the number of delays.
- This problem attempts to show that a complex loop, which is a combination of 2 simple or fundamental loops, cannot introduce a new iteration bound. To show this, consider two loops with loop computation times
*T*_{1}and*T*_{2}, respectively, and with number of delay elements*N*_{1}and*N*_{2}, respectively. Let*T*_{1}/*N*_{1}>*T*_{2}/*N*_{2}hold. Show that - Our objective in this problem is to prove that the critical path of a
*J*-unfolded DFG is a monotonically nondecreasing function with respect to*J*[11]. To show this, prove that the critical path of a*J*-unfolded DFG is greater than or equal to the critical path of the (*J*− l)-unfolded DFG. - 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

*T*≤_{crit}*JT*{

Start Free Trial

No credit card required