Q $4($a$)$

Consider the Data Flow Graph $($DFG$)$ below. Assuming that the multipliers and adders

take $1$ time unit, identify all the loops in the DFG and compute the critical loop bound.

Q $4($b$)$

For the DFG in Q$4($a$),$ calculate the critical path delay.

Q $4($c$)$

Perform a retiming of the DFG$,$ in Q $4($a$).$ Draw the retimed DFG and calculate the

new critical path delay. Explain the retiming methods used and describe$/$draw each

step.