Consider the recursive filter x(n) = ax(n-2) + u(n). (3.46) (a) Pipeline this multiply-add operator by...

 

Transcribed Image Text:

Consider the recursive filter x(n) = ax(n-2) + u(n). (3.46) (a) Pipeline this multiply-add operator by 2 stages, by first breaking up the multiply-add operation into 2 components and by redis- tributing the delay elements in the loop. (b) Interleave the computation in (3.46) with (3.47) y(n) by (n-2) +v(n). (3.47) using the same hardware. Now pipeline the multiply-add operation by 4 stages. Show all the circuits needed for this implementation. Consider the recursive filter x(n) = ax(n-2) + u(n). (3.46) (a) Pipeline this multiply-add operator by 2 stages, by first breaking up the multiply-add operation into 2 components and by redis- tributing the delay elements in the loop. (b) Interleave the computation in (3.46) with (3.47) y(n) by (n-2) +v(n). (3.47) using the same hardware. Now pipeline the multiply-add operation by 4 stages. Show all the circuits needed for this implementation.