4) 5) The lattice filter shown below in Figure 1 is to be folded by a factor of 2. The folding sets are given as SA1 = {A2, A1} [this means, A2 is scheduled at 21+0, A1 is scheduled at 21+ 1], SA2 = {A3, A4), SM1 = {M1, M2}, SM2 = {M3, M4}, SM3 = {6, M5} [o denotes unused cycle]. The adders and multipliers are pipelined by 1 and 2 latches respectively. Calculate the folding delays DF(UV) for every edge U V. Then, the number of edges with non-negative folding delays is (a) 4. (b) 3. (c) 6. (d) 5. 1 point In Question 4, the number of edges with zero folding delays is (a) 1, (b) 2, (c) 3, (d) 4. 6) 1 point In question 4, the edge that will have the maximally negative folding delay is (a) Mr A, (b) A M5, (c) M4 A3, (d) M3 A3. 7) 1 point In Question 4, the edge that will have the maximally positive folding delay is (a) A2 A, (b) A2 M, (c) A3 A, (d) A2 M. 8) 1 point To avoid emergence of negative folding delays, suppose the lattice filter of Fig- ure 1 is first retimed by assigning retiming values to nodes (e.g., retiming value r(U) is assigned to node U). Then, Identify the incorrect inequality from the following: (a) r(A)-r(M) 0, (b) r(A3) - r(A4) 0, (c) r(M) - r(A) -1. (d) r(A)-r(M) -1. 9) 1 point Identify the correct inequality from the following: (a) r(M) - r(A) 0, (b) r(A3) - r(A) 0, (c) r(A) - r(M) 1, (d) r(A) r(M). IN A2 (SA1/0) M2 (SM1/1) A1 (SA1/1) M3 (SM2/0) M1 (SM1/0) M4 (SM2/1) A3 (SA2/0) M5 (SM3/1) OUT A4 (SA2/1) Figure 1: Figure for problems 4-9. SA1-(A2, A1) SA2=(A3, A4) SM1=(M1, M2) SM2=(M3, M4) SM3=(. M5)