Question Paper Code:: (10×2 20 Marks)
Question Paper Code:: (10×2 20 Marks)
Question Paper Code:: (10×2 20 Marks)
5. What is the advantage of modified cook Toom algorithm over a cook Toom
algorithm ?
7. Draw the bit level Dependence Graph (DG) 4×4 bit carry ripple array
multiplication.
11. a) i) Draw the block diagram description of the computation y(n) = ay(n-1) + x(n).
Analyze and represent the same computation in both conventional
and synchronous data flow graph (DFG). (7)
ii) Determine and analyze loop bound and iteration bound shown in Figure. (6)
(OR)
b) i) Draw and analyze data broadcast structure and fine grain pipeline of the
FIR filter. (7)
ii) Summarize in detail about pipelining and parallel processing for low
power
applications. (6)
13. a) Construct a 2×2 convolution algorithm using cook Toom algorithm with
β=0, β=–1 and β=1. (13)
(OR)
b) Consider the following first order IIR filter transfer function and derive the
filter structure with 4 level pipelining and 3 level block processing (M=4 and
1
L=3). H (z ) = . (13)
1 − az −1
14. a) Explain in detail about design Iyon’s bit serial multiplier using horner’s rule
with neat sketches. (13)
(OR)
b) Obtain the CSD number for the following the 2’s complement number
i) 0.00010110
ii) 1.11111111. (13)
15. a) Explain detail about the subexpression elimination and multiple constant
multiplication with neat sketches. (13)
(OR)
b) Discuss in detail about wave pipelining and bundled data versus dualrail
protocol. (13)
16. a) Design and analyze the clock skew in edge triggered single phase and two
phase clocking. (15)
(OR)
b) Examine and describe in detail about real time applications of different DSP
algorithms. (15)
_______________________