DSP QB
DSP QB
Branch and Section: ECE A, B & C Subject: Digital Signal Processing DSP
UNIT-I
P a g e | 1 of 12
9. If Fx and Fy are the sampling rates of the input and output signals respectively, then
what is the value of Fy/Fx? [ b ]
a) D-I b) I/D c) I.D d) I2D
10. Which of the following is the advantage of sampling rate conversion by converting the
signal into analog signal? [ b ]
a) Less signal distortion b) New sampling rate can be arbitrarily selected
c) Quantization effects d)All of the above
14. A causal system is one whose output depends on present and past values of input.
15. A system is said to be stable if every bounded input produces a bounded output.
16. The process of increasing the sampling rate of a signal by a factor I is called
Interpolation.
17. The systems that employ multiple sampling rates are called multi-rate DSP systems.
(True/False) True
18. A system whose output y(n) at time n depends only on the present and past inputs is
called a non-recursive system.
19. The Frequency-domain relationships can be obtained by combining the results of the
interpolation and decimation processes.
20. The basic element used to construct the block diagram of a discrete-time system are
adder, constant multiplier, unit delay element.
P a g e | 2 of 12
UNIT-II
P a g e | 3 of 12
2) The Discrete Time Fourier Transform is nothing but the Z-transform evaluated at a
finite number of equally spaced points on the unit circle centred at the origin of z-
plane.
6) The Fast Fourier Transform may be defined as an algorithm for computing Discrete
Fourier Transform.
8) The basic Fast Fourier Transform algorithms are DIT FFT and DIF FFT.
9) For DIT Fast Fourier Transform, the input is in bit reversed order and the output is
in normal order.
10) For DIF Fast Fourier Transform, the input is in normal order and the output is in bit
reversed order.
UNIT-III
P a g e | 6 of 12
10) For a system function H(s) to be stable [ c ]
a) The zeros lie in left half of the s plane
b) The zeros lie in right half of the s plane
c) The poles lie in left half of the s plane
d) The poles lie in right half of the s plane
4) Stable continuous system can be mapped into realizable stable digital systems using
Bilinear transformation.
6) The transition band is more in Butterworth filter when compared to Chebyshev filter
7) In the frequency response characteristics of FIR filter, the number of bits per
coefficient should be increased in order to maintain the same error.
9) Transition band is the region between stop band and the pass band frequencies in the
magnitude frequency response of a low pass filter.
10) In bilinear transformation, the left-half s-plane is mapped inside the unit circle |z|=1
in the z-domain.
P a g e | 7 of 12
UNIT-IV
P a g e | 8 of 12
6) Which of the following is the first method proposed for design of FIR filters?
[ c ]
a) Chebyshev approximation
b) Frequency sampling method
c) Windowing technique
d) None of the mentioned
7) Which of the following technique is more preferable for design of linear phase FIR
filter? [ b ]
a) Window design
b) Chebyshev approximation
c) Frequency sampling
d) None of the mentioned
8) The anti-symmetric condition with M even is not used in the design of which of the
following linear-phase FIR filter? [ a ]
a) Low pass
b) High pass
c) Band pass
d) Bans stop
9) A filter is said to be linear phase filter if the phase delay and group delay are [ d ]
a) High
b) Moderate
c) Low
d) Constant
10) In FIR filters, which among the following parameters remains unaffected by the
quantization effect? [ d ]
a) Magnitude Response
b) Phase Characteristics
c) Both a and b
d) None of the above
P a g e | 9 of 12
Fill in the Blanks
1) The difference equation of the FIR filter of length M, input x(n) and output y(n) is
2) The unit sample response of a FIR filter inorder to have a linear phase should satisfy
±h(M-1-n) n=0,1,2…M-1
3) FIR filters are always stable because all its pole are at the origin.
5) The anti-symmetric condition with M even is not used in the design of low pass
linear-phase FIR filter.
6) The central lobe of the frequency response of the window should be narrow with
more energy.
7) FIR filters are of non recursive type where as IIR filters are of recursive types.
8) Filters with any arbitrary magnitude response can be realized using FIR sequence.
9) The major methods for designing FIR filters with linear phase are windows method,
frequency sampling method and optimal or minimax design.
10) In Barlett window, the triangular function resembles the tapering of rectangular
window sequence linearly from the middle to the ends.
11) In FIR filter design, parameters that are separately controlled by using Kaiser
window are order of filter (M) and transition width of main lobe.
P a g e | 10 of 12
UNIT-V
P a g e | 11 of 12
Fill in the Blanks
11.Truncation is defined as the process of discarding all bits less significant than least
significant bit that is retained.
12.Zero input limit cycles and Overflow limit cycles are the types of limit cycles.
13.Zero input limit cycles are of lower amplitudes in comparison with overflow limit
cycles.
14.In practice, 1-Dimensional Finite Impulse Response (FIR) filters are employed in
filtering problems where there is a requirement for a linear-phase characteristic
within the passband of the filter.
15.The dead band of a single pole filter with a pole at 1/2 and represented by 4 bits is
(-1/16, 1/16).
16.The range of values of z for which X(z) converges is called the ROC of X(z).
18.Zero input limit cycles are of lower amplitudes in comparison with overflow limit
cycles.
19.The Overflow error occurs when two large numbers of the same sign are added and
the result exceeds the word-length.
20.Limit cycles can occur due to overflow in digital filters implemented with finite
precision arithmetic.
P a g e | 12 of 12
Bhoj Reddy Engineering College for Women, Hyderabad
Academic Year: 2020-2021 (R18) III BTech II semester Branch: ECE A, B and C
UNIT-I:
Introduction: Introduction to Digital Signal Processing: Discrete Time Signals & Sequences, conversion
of continuous to discrete signal, Normalized Frequency, Linear Shift Invariant Systems, Stability, and
Causality, linear differential equation to difference equation, Linear Constant Coefficient Difference
Equations, Frequency Domain Representation of Discrete Time Signals and Systems
TEXT BOOKS:
B1: Digital Signal Processing, Principles, Algorithms, and Applications: John G. Proakis, Dimitris
G. Manolakis. Pearson Education / PHI. 2007.
B2: Discrete Time Signal Processing-A. V. Oppenheim and R.W. Schaffer. PHI, 2009
B3: Digital Signal Processing - P. Ramesh Babu, Fourth Edition.
B4: Digital Signal Processing – A.Anand Kumar –PHI Learning 2013.
B5: Digital Signal Processing - S.Salivahanan. and A.Vallavaraj TMH.2003.
Question Bank:
1. Define various elementary discrete-time signals, indicate them graphically. (B4, PP: 5)
2. What are the Basic Elements of a Digital Signal Processing System explain with block diagram?
(B1, PP: 4)
3. What are Advantages and Limitations of Digital Signal Processing over Analog Signal Processing
(B1, PP: 5)
4. What are the classification of Discrete-Time Signals and explain each classification with example.
(B3, PP: 1.33)
5. What are the Basic Operations on Signals? (B3, PP: 1.43)
6. What are the classifications of Discrete –Time Systems? (B4. PP: 33)
7. Determine if the system described by the following input-output equations is linear or non-
linear (i) y(n)=x(n)+1/(x(n-1)) (ii) y(n)=x2(n) (iii) y(n)=nx(n) (B3, PP :1.55)
8. Determine if the following systems are time-invariant or time variant
9. (i) y(n)=x(n)+x(n-1) (ii) y(n)=x(-n) (B3, PP : 1.57)
10. What are stable and unstable systems ? (B4, PP: 49)
11. Derive the expression for Linear constant coefficient Difference Equations. (B3, PP: 1.83)
12. Determine the solution of the difference equation y(n) = 5/6y(n-1) – 1/6y(n-3) + x(n) for
x(n)=2nu(n) (B3, PP: 1.98)
13. What is Frequency Domain representation of Discrete Time Signals and Systems? (B3, PP: 1.99)
1
14. Define sampling rate conversion, Multirate digital Signal Processing?Explain the methods of
sampling rate conversion? (B1, pp: 750)
15. Explain the process of down sampling or decimation by a factor D ? (B1, pp: 755-758)
16. Explain the process of up sampling or interpolation ? (B1, pp: 755-758)
17. Discuss the general cases of sampling rate conversion by a factor I/D? (B1, pp: 763-765)
18. Consider a causal and stable LTI system whose difference equation is y(n)-1/6y(n-1)-1/6 y(n-
2)=x(n) .Determine impulse response h(n) for the system. (B3,pp:1.40)
19. The difference equation y(n)=5/6 y(n-1)-1/6 y(n-2)+x(n).Determine impulse response and also step
response of the system. ( B 3, pp:1.40)
20. Determine the response y(n), n≥ 0 of the system described by the second-order difference equation
Y(n)-4y(n-1)+4y(n-2)=x(n)-x(n-1) when the input is x(n)=(−1)𝑛 u(n) and the initial conditions are
y(-1)=y(-2)=1 (B3, pp:1.45)
UNIT-II:
Discrete Fourier series: Fourier series, Fourier Transform, Laplace Transform and Z-Transform
Relation, DFS Representation of Periodic Sequences, Properties of Discrete Fourier series, Discrete
Fourier Transforms: Properties of DFT, Linear Convolution of Sequences using DFT, Computation
of DFT: Over-Lap Add Method, Over-Lap Save Method, Relation between DTFT, DFS, DFT and
ZTransform.
Fast Fourier Transforms: Fast Fourier Transforms (FFT) - Radix-2 Decimation-in-Time and
Decimation-in-Frequency FFT Algorithms, Inverse FFT.
TEXT BOOKS:
B1: Digital Signal Processing, Principles, Algorithms, and Applications: John G. Proakis, Dimitris
G. Manolakis. Pearson Education / PHI. 2007.
B2: Discrete Time Signal Processing-A. V. Oppenheim and R.W. Schaffer. PHI, 2009
B3: Digital Signal Processing - P. Ramesh Babu, Fourth Edition.
B4: Digital Signal Processing – A.Anand Kumar –PHI Learning 2013.
B5. Digital Signal Processing - P. Ramesh Babu, Second Edition
B6.Digital Signal Processing-S.Salivahanan,C.Gnanapriya ,2nd Edition
Question Bank:
1. Write about the relation between DFT and Z-Transform, DTFT and DFT (B4, PP: 419,426)
2. Explain the properties of DFS (B4, PP:3.2)
3. Explain the following DFT properties (i)Linearity (ii)Time shifting (iii)Symmetry (B4, PP:418)
4. Explain the following DFT properties (i)Linearity (ii)Circular shift of a sequence (iii)DFT of Even
and Odd sequences (iv)Time reversal properties (B2, PP: 101)
5. Explain the following DFT properties (i)Complex Conjugate Property (ii)DFT of Delayed Sequence
(iii)DFT of Real Valued Sequence (B4, PP: 434)
6. Explain the following DFTproperties (i)Multiplication (ii)Circular convolution (iii)Parseval’s
Theorem (iv)Circular correlation (B5, PP: 436)
7. Find the DFT of a sequence x(n)={1, 1, 0, 1} and find the IDFT of Y(k)= {1, 0, 1, 0}
(B3, PP: 3.12)
8. Find IDFT of the sequence X(k) = {5, 0, 1-j, 0, 1+j, 0} (B3, PP: 3.21)
2
9. What are the methods to evaluate circular convolution of two sequences (B3, PP:3.42)
10. Find the 8-point DFT of x(n) = {1, 1, 0, 0, 0, 0, 0, 0}. Use the property of conjugate symmetry
property (B4, PP: 430)
11. Find the circular convolution of the two sequences x1(n) = {1, 2, 2, 1} and x2(n) = {1, 2, 3, 1} using
(a) concentric circle method (b) matrix method (B3, PP: 3.45)
12. Find the output y(n) of a filter whose impulse response is h(n)={1, 1,1} and input signal x(n) = {3,
-1, 0, 1, 3, 2, 0, 1, 2, 1}using overlap-save method (B3, PP: 3.54)
13. Find the output y(n) of a filter whose impulse response is h(n)={1, 1,1} and input signal x(n) = {3,
-1, 0, 1, 3, 2, 0, 1, 2, 1}using overlap-add method (B3, PP: 3.54)
14. State the difference between overlap-save method and over add method, Linear Convolution and
circular convolution (B3, PP: 3.86, 3.88)
15. Compute the DFT of a sequence (-1)n for N=4 (B3, PP: 3.61)
16. Describe the efficient method for computation of DFT? (B1, PP: 511-512)
17. What is FFT?Bring out its 2 classes of FFT algorithms? (B5, PP: 4.2)
18. Illustrate the principle of Decimation in time FFT Algorithm? (B2, PP 290-294)
19. Illustrate the principle of Decimation in frequency FFT Algorithm? (B2, PP 290-294)
20. Summarize the steps of radix 2 DIT-FFT Algorithms? (B5, PP: 4.12)
21. Draw the flow graph of 16 point DIT-FFT? (B5, PP: 4.16)
22. Compare the computational complexity for the direct computation of DFT versus FFT Algorithm?
(B1, PP: 522)
23. List out the requirements for the direct computation of DFT? (B1, PP:512-8.1.1 )
24. What is bit reversal process?Tabulate the bit reversal process for N=8? (B5, PP: 4.10)
25. What are the applications of FFT? (B1, PP: 538)
26. Compute the 8 point DFT of the sequence x(n)=1 for 0<=n<=7, otherwise by using DIT,DIF
Algorithm? (B5, PP: 4.26)
27. Compute the 4 point DFT of the sequence x(n)={0,1,2,3}using DIT,DIF Algorithm? (B5, PP: 4.27)
28. If x(n)={1,2,3,4,4,3,2,1},Find X(k)using DIF FFT Algorithm? (B6, PP: 396)
29. Draw the basic butterfly diagram and flow graph for the computation of DIT -FFT and
DIF FFT ? (B6, PP: 388-396)
30. Determine DFT (8 point) for a continuous time signal x(t)=sin(2∏ft) with f=50HZ?(B6, PP: 402)
31. When do we use compose Radix FFT,Develop a radix-3 DIT and DIF-FFT algorithm for N=9?
(B6, PP: 404)
32. Develop a DIF-FFT algorithm for decomposing the DFT for N=6 and draw the flow diagrams
33. for a)N=3.2 b)N=2.3 (B6, PP: 415)
34. Given X(K)={36,-4+j9.656,-4+j4,-4+j6.56,-4,-4-j1.656,-4-j4,-4-j9.656},Find x(n)? (B6, PP: 402)
35. Describe the method of computing an inverse DFT by doing a direct DFT? (B6, PP: 399)
UNIT-III:
IIR Digital Filters: Analog filter approximations – Butterworth and Chebyshev, Design of IIR Digital
Filters from Analog Filters, Step and Impulse Invariant Techniques, Bilinear Transformation Method,
Spectral Transformations.
TEXT BOOKS:
B1. John G. Proakis, Dimitris G. Manolakis, “Digital signal processing, principles, Algorithms and
applications”, Pearson Education/PHI, 4th ed., 2007.
3
B2. Sanjit K Mitra, “ Digital signal processing , A computer base approach”, Tata Mcgraw Hill, 3rd
edition, 2009.
B3. A.V. Oppenheim and R.W. Schaffer, “Discrete Time Signal Processing”, 2nd ed., PHI.
B4. P. Ramesh Babu, “Digital Signal Processing”, Scitech Publications, 2nd ed, 2005.
Question Bank:
1. What are different types of frequency selective filters? Explain in detail. (B4, pp: 5.2)
2. Explain the indirect method used for designing IIR digital filters. (B4, pp: 5.4)
3. Differentiate analog and digital filters and list out advantages and disadvantages of digital filters.
i. (B4, pp:5.5)
4. Derive the order equation for low pass Butterworth analog filter. (B4, pp:5.7)
5. Given the specification α p =1 dB, α s =30 dB, Ω p =200 rad/sec, Ωs =600 rad/sec. Determine the
order of the filter. (B4, pp: 5.13)
Ωp Ωs
Ωc = =
((10 α p− 1) /2 N ) ((10 αs )1 /2 N )
0.1 1 0.1
6. Prove that (B4, pp: 5.14)
2
H (s)=
7. Apply bilinear transformation to [(s+1)(s+2)] with T=1 sec and find H(Z) (B4, pp: 5.52)
2
H (s)=
8. For the analog transfer function [(s+1)(s+2)] determine H(Z) using impulse invariance
method. Assume T=1 sec. (B4, pp: 5.53)
10
H ( S)= 2
9. An analog filter has a transfer function S + 7 S+ 10 . Design a digital filter eqivalent to this
using impulse invariant method. (B4, pp: 5.59)
α
10. Design a Chebyshev low pass filter with specifications p =1 dB ripple in the pass band 0 ω 2 Π
α
and s =15 dB in the stop band 0.3 Π⩽ω⩽ Π using (a). bilinear transformation (b). Impulse
Invariance (B4, pp: 5.91)
11. Design a Butterworth filter using the impulse invariance and impulse bilinear transformation method
for following specifications
UNIT-IV:
FIR Digital Filters: Characteristics of FIR Digital Filters, Frequency Response, Design of FIR Filters:
Fourier Method, Digital Filters using Window Techniques, Frequency Sampling Technique, Comparison of
IIR & FIR filters.
TEXT BOOKS:
B1. John G. Proakis, Dimitris G. Manolakis, “Digital signal processing, principles, Algorithms and
applications”, Pearson Education/PHI, 4th ed., 2007.
B2. Sanjit K Mitra, “ Digital signal processing , A computer base approach”, Tata Mcgraw Hill, 3rd
edition, 2009.
B3. A.V. Oppenheim and R.W. Schaffer, “Discrete Time Signal Processing”, 2nd ed., PHI.
B4. P. Ramesh Babu, “Digital Signal Processing”, Scitech Publications, 2nd ed, 2005.
Question Bank:
1. Explain the symmetrical impulse response of FIR filters for N odd. (B4, pp: 6.7)
2. Explain the symmetrical impulse response of FIR filters for N even. (B4, pp: 6.8)
3. Explain the antisymmetrical impulse response of FIR filters for N odd. (B4, pp: 6.9)
4. Explain the antisymmetrical impulse response of FIR filters for N even. (B4, pp: 6.10)
5. Explain the Fourier series method in designing FIR filters (B4, pp: 6.16)
6. Design an ideal LPF with a frequency response d
H (e jω)= 1 for − Π /2 ⩽ ω ⩽ Π /2 and
H d (e jω)= 0 for − Π /2 ⩽ |ω|⩽ Π . Find the values of h(n) for N=11. Find H(Z). Plot the
magnitude response. (B4, pp: 6.18)
jω
7. Design an ideal HPF with a frequency response
H d (e )= 1 for − Π /4 ⩽ |ω|⩽ Π and
H d (e jω)= 0 for |ω|<Π /4 . Find the values of h(n) for N=11. Find H(Z). Plot the magnitude
response. (B4, pp: 6.22)
5
8. Design an ideal BPF with a frequency response
H d (e jω)= 1 for − Π /4 ⩽ |ω|⩽ 3 Π /4 and
H d (e jω)= 0 otherwise. Find the values of h(n) for N=11. Find H(Z). Plot the frequency
response. (B4, pp: 6.25)
9. Design an ideal BRF with a frequency response
H d (e jω)= 1 for |ω|⩽ Π /3 and |ω|⩾2 Π /3
H d (e jω)= 0 otherwise. Find the values of h(n) for N=11. Find H(Z). Plot the magnitude response.
(B4, pp: 6.28)
10. Design an ideal HPF using (a). Hanning window and (b). Hamming window with a frequency
response d
H (e jω)= 1
for − Π /4 ⩽ |ω|⩽ Π and d
H (e jω)= 0
for |ω|<Π /4 . Find the values of
h(n) for N=11. Find H(Z). Plot the magnitude response. (B4, pp: 6.47)
11.
H (e jω)= e− j 3 ω
Design a filter with d for − Π /4 ⩽ ω ⩽ Π /4 and
H d (e jω)= 0 for Π /4 <|ω|⩽ Π
using Hanning window with N=7. (B4, pp: 6.53)
H d (e jω)= jω
12. Design a filter with for − Π ⩽ ω ⩽ Π using (i) Rectangular Window (ii)Hamming
window with N=7. Plot frequency response in both the cases. (B4, pp: 6.55)
jω
13. Design an ideal Hilbert transform having frequency response H (e )= j for − Π ⩽ ω ⩽ 0 and
H (e jω)= − j for 0 ⩽ ω ⩽ Π using (i). rectangular window (ii). Blackman window for N=11. Plot
frequency response in both cases. (B4, pp: 6.61)
14. Design a FIR LP filter satisfying the following specifications α p⩽0.1 dB , α s≥ 44.0 dB ,
ωp = 20 rad /sec ωs = 30 rad/sec and ωsf = 100 rad / sec (B4, pp: 6.72)
15. Design a FIR band pass digital filter satisfying the following specifications α p⩽0.1 dB ,
α s≥ 44.0 dB , f p1 = 20 Hz , f p2 = 30 Hz , f s 1= 10 Hz , f s 2= 40 Hz and F=100Hz. (B4, pp: 6.72)
α p= 0 .5 dB
16. Design a FIR band pass digital filter satisfying the following specifications ,
α s = 30 dB f p1 = 20 Hz f p2 = 30 Hz f s 1= 10 Hz f s 2= 40 Hz
, , , , and F=100Hz. (B4, pp: 6.76)
17. Determine the filter coefficients h(n) obtained by sampling
6
23. Do the above example using Hamming window. (B4, pp: 6.101)
24. Determine the frequency response of FIR filter defined by y(n)=0.25x(n)+x(n-1)+0.25x(n-2).
Calculatethe phase delay and group delay. (B4, pp: 6.104)
UNIT-V:
Realization of Digital Filters: Applications of Z – Transforms, Solution of Difference Equations of Digital
Filters, System Function, Stability Criterion, Frequency Response of Stable Systems, Realization of Digital
Filters – Direct, Canonic, Cascade and Parallel Forms.
Finite Word Length Effects: Limit cycles, Overflow Oscillations, Round-off Noise in IIR Digital Filters,
Computational Output Round off Noise, Methods to Prevent Overflow, Trade-off between Round Off and
Overflow Noise, Measurement of Coefficient Quantization Effects through Pole-Zero Movement, Dead
Band Effects.
TEXT BOOKS:
B1: Digital Signal Processing, Principles, Algorithms, and Applications: John G. Proakis, Dimitris G.
Manolakis. Pearson Education / PHI. 2007,4th edition
B2: Discrete Time Signal Processing-A. V. Oppenheim and R.W. Schaffer. PHI, 2009
B3: Digital Signal Processing - P. Ramesh Babu, Fourth Edition.
B4. Digital Signal Processing - P. Ramesh Babu, Second Edition
B5.Digital Signal Processing- S.Salivahanan, C.Gnanapriya,2nd Edition
Question Bank:
1. Show that if r=1 the Z-Transform expression is equal to the Fourier transform of the sequence.
(B2, PP: 46)
2. What are the Properties of ROC in Z-Transform with example (B1, PP: 148)
3. Explain the following z-Transform properties (i)Linearity (ii)Time shifting (iii)Multiplication
(B3, PP:2.8)
4. Explain the following z-Transform properties (i)Differentiation (ii)Time reversal (iii)convolution
theorem (B3, PP: 2.10)
5. Explain the following z-Transform properties (i)Complex Convolution Theorem (ii)Parseval’s
relation (iii)Correlation (B3, PP:2.12)
6. Explain initial value theorem and final value theorem with proof (B3, PP: 2.14)
7. Determine the inverse z-transform using power series expansion of X(z)=1/(1-1.5z-1+0.5z-2) when
ROC: |z|>1 and ROC:|z|<0.5 (B1, PP:182)
8. Determine the Partial fraction expansion of X(z) = (1-Z-1) / (1-z-1+-.5z-2) (B1, PP: 187)
9. Derive the expression for system function, and what are pole-zero system, zero system and pole
system? (B3, PP: 2.23)
10. Compute the response of the system y(n) = 0.7y(n-1) - 0.12y(n-2) + x(n-1) + x(n-2) to input
x(n)=nu(n). Is the system is stable? (B3, PP: 2.56)
11. Determine the frequency response, magnitude response, phase response and time delay of the
system given by y(n) + ½ y(n-1) = x(n) – x(n-1) (B5, PP: 224)
12. What are basic realization block diagram and the signal-flow graph and canonic and non-canonic
structures? (B5, PP:242)
13. Explain Direct form realization of IIR systems with block diagram (B5, PP:244)
14. Explain Cascade Realization of IIR systems with block diagram (B5, PP:251)
7
15. Obtain a cascade realization of the system characterized by the transfer function
16. H(z) = (2(z+2)) / (z(z-0.1) (z+0.5) (z+0.4)) (B5, PP: 252)
17. Explain Parallel Realization of IIR systems with block diagram (B5, PP: 253)
18. Determine the parallel realization of IIR digital filter transfer functions H(z) =
(3(2z2 + 5z + 4) / ((2z+1) (2z+2)) (B5, PP:254)
19. Expalin basic structures for FIR systems, Direct form Realisation of FIR systems, cascade form
Realization of FIR systems. (B5, PP: 271)
20. Define sampling rate conversion, MultiMate digital Signal Processing?Explain the methods of
sampling rate conversion? (B1, pp: 750)
21. Explain the process of down sampling or decimation by a factor D ? (B1, pp: 755-758)
22. Explain the process of up sampling or interpolation ? (B1, pp: 755-758)
23. Discuss the general cases of sampling rate conversion by a factor I/D? (B1, pp: 763-765)
24. Obtain the two-fold expanded signal y(n) of the input signal x(n)=n for n>0,0otherwis(B5, pp: 594)
25. What are the errors that arise due to quantization of numbers? (B3, pp: 7.1)
26. Describe the forms that are used to represent the numbers in a digital computer? (B3, pp: 7.3-7.7)
27. Compare floating point and fixed point arithmetic? (B3, pp: 7.8)
28. Discuss floating point numbers and blocked floating point numbers? (B3, pp: 7.7-7.9)
29. What are the methods of quantization?Explain them. (B3, pp: 7.9-7.10)
30. Draw the quantizer characteristics for probability density function? (B3, pp: 7.15-7.16)
31. Find the steady state variance of the noise in the output due to quantization of input for the first
order filter? (B3, pp: 7.20)
32. Realize the first order transfer function,draw its quantization noise model. Find the steady state
noise power due to product roundoff.? (B3, pp: 7.20)
33. What is zero input limit cycle oscillations,consider first order difference equation and explain
about it? (B3, pp: 7.30)
34. What is signal scaling.Derive its formula? (B3, pp: 7.33-7.35)
35. Discuss finite word length effects in FIR digital filters?(B3, pp:7.41)
36. Explain about the Dead band effect? (B3, pp:7.31)
37. Realize the IIR Digital filter by floating point quantization? (B3, pp:7.37)
38. The input to the system is y(n)=0.999y(n-1)+x(n) is applied to D.C.What is the power produced by
the quantization noise at the output of the filter if the input is quantized to a)8 bits b)16 bits?
(B3, pp:7.37)
39. Explain the characteristics of a limit cycle oscillation with respect to a system described by
the difference equation y(n)=0.95y(n-1)+x(n).Determine the dead band of the filter? (B3, pp:7.55)
40. A digital system is characterized by the difference equation y(n)=0.9y(n-1)+x(n) with x(n)=0,
and initial condition y(-1)=12.Determine the dead band of the system? (B5, pp:571)