DSP Answers PDF

www.Vidyarthiplus.
com
EC1302 DIGITAL SIGNAL PROCESSING 3 1 0 100

AIM
To study the signal processing methods and processors.
OBJECTIVES
To study DFT and its computation
To study the design techniques for digital filters
To study the finite word length effects in signal processing
To study the non-parametric methods of power spectrum estimations
To study the fundamentals of digital signal processors.
UNIT I FFT 9
Introduction to DFT Efficient computation of DFT Properties of DFT FFT algorithms
Radix-2 FFT algorithms Decimation in Time Decimation in Frequency algorithms Use of
FFT algorithms in Linear Filtering and correlation.
UNIT II DIGITAL FILTERS DESIGN 9

Amplitude and phase responses of FIR filters Linear phase filters Windowing techniques
for design of Linear phase FIR filters Rectangular, Hamming, Kaiser windows frequency
sampling techniques IIR Filters Magnitude response Phase response group delay -
Design of Low Pass Butterworth filters (low pass) - Bilinear transformation prewarping,
impulse invariant transformation.
UNIT III FINITE WORD LENGTH EFFECTS 9

Quantization noise derivation for quantization noise power Fixed point and binary
floating point number representation comparison over flow error truncation error co-
efficient quantization error - limit cycle oscillation signal scaling analytical model of
sample and hold operations.
UNIT IV POWER SPECTRUM ESTIMATION 9

Computation of Energy density spectrum auto correlation and power spectrum of random
signals. Periodogram use of DFT in power spectrum estimation Non parametric methods
for power spectral estimation: Bartlett and Welch methods Blackman and Tukey method.
UNIT V DIGITAL SIGNAL PROCESSORS 9

Introduction to DSP architecture Harvard architecture - Dedicated MAC unit - Multiple
ALUs, Advanced addressing modes, Pipelining, Overview of instruction set of TMS320C5X
and C54X.
TEXT BOOKS
1. John G Proakis, Dimtris G Manolakis, Digital Signal Processing Principles, Algorithms and
Application, PHI, 3rd Edition, 2000,
2. B.Venkataramani & M. Bhaskar, Digital Signal Processor Architecture, Programming and
Application, TMH 2002. (UNIT V)
REFERENCES
1. Alan V Oppenheim, Ronald W Schafer, John R Back, Discrete Time Signal Processing, PHI, 2nd
Edition 2000,
2. Avtar singh, S.Srinivasan DSP Implementation using DSP microprocessor with Examples from
TMS32C54XX -Thamson / Brooks cole Publishers, 2003
3. S.Salivahanan, A.Vallavaraj, Gnanapriya, Digital Signal Processing, McGraw-Hill / TMH, 2000
4. Johny R.Johnson :Introduction to Digital Signal Processing, Prentice Hall, 1984.
5. S.K.Mitra, Digital Signal Processing- A Computer based approach, Tata McGraw-Hill, 1998,
New Delhi.
www.Vidyarthiplus.com
www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 21

EC2302 DIGITAL SIGNAL PROCESSING 23













DEPARTMENT OF ECE, ADHIPARASAKTHI COLLEGE OF ENGINEERING, KALAVAI.

UNIT 1 INTRODUCTION TO FFT

1. What is DFT?
It is a finite duration discrete frequency sequence, which is obtained by sampling one period of
Fourier transform. Sampling is done at N equally spaced points over the period extending from
w=0 to 2.
2. Define N point DFT.

The DFT of discrete sequence x(n) is denoted by X(K). It is given by,
Here k=0,1,2N-1
Since this summation is taken for N points, it is called as N-point DFT.
3. What is DFT of unit impulse (n)?

The DFT of unit impulse (n) is unity.
4. List the properties of DFT.

Linearity, Periodicity, Circular symmetry, symmetry, Time shift, Frequency shift, complex
conjugate, convolution, correlation and Parsevals theorem.
5. State Linearity property of DFT.

DFT of linear combination of two or more signals is equal to the sum of linear combination of
DFT of individual signal.
6. What is the Periodicity property of DFT?

DFT of a finite length sequence results in a periodic sequence.

7. When a sequence is called circularly even?

The N point discrete time sequence is circularly even if it is symmetric about the point zero on
the circle.
8. What is the condition of a sequence to be circularly odd?

An N point sequence is called circularly odd it if is antisymmetric about point zero on the circle.
9. Why the result of circular and linear convolution is not same?

Circular convolution contains same number of samples as that of x (n) and h (n), while in linear
convolution, number of samples in the result (N) are,
N=L+M-1
Where L= Number of samples in x (n)
M=Number of samples in h (n)
10. What is circular time shift of sequence?

Shifting the sequence in time domain by 1 samples is equivalent to multiplying the sequence in
frequency domain by WNkl
11. What is the disadvantage of direct computation of DFT?

For the computation of N-point DFT, N2 complex multiplications and N[N-1] Complex additions
are required. If the value of N is large than the number of computations will go into lakhs. This
proves inefficiency of direct DFT computation.
12. What is the way to reduce number of arithmetic operations during DFT computation?
Number of arithmetic operations involved in the computation of DFT is greatly reduced by using
different FFT algorithms as follows.
1. Radix-2 FFT algorithms.

-Radix-2 Decimation in Time (DIT) algorithm.
- Radix-2 Decimation in Frequency (DIF) algorithm.

2. Radix-4 FFT algorithm.
13. What is the computational complexity using FFT algorithm?

1. Complex multiplications = N/2 log2N
2. Complex additions = N log2N
14. How linear filtering is done using FFT?

Correlation is the basic process of doing linear filtering using FFT. The correlation is nothing but
the convolution with one of the sequence, folded. Thus, by folding the sequence h (n), we can
compute the linear filtering using FFT.
15. What is zero padding? What are its uses?

Let the sequence x (n) has a length L. If we want to find the N point DFT (N>L) of the sequence x
(n). This is known as zero padding. The uses of padding a sequence with zeros are
(i) We can get better display of the frequency spectrum.

(ii) With zero padding, the DFT can be used in linear filtering.
16. Define Circular convolution.

Let x1 (n) and x2 (n) are finite duration sequences both of length N with DFTs X1 (K) and X2 (K).
If X3 (K) = X1 (K) X2 (K), then the sequence x3 (n) can be obtained by circular convolution, defined
as
17. Why FFT is needed?

The direct evaluation of the DFT using the formula requires N2 complex multiplications and N (N-
1) complex additions. Thus for reasonably large values of N (inorder of 1000) direct evaluation of
the DFT requires an inordinate amount of computation. By using FFT algorithms the number of
computations can be reduced. For example, for an N-point DFT, The number of complex
multiplications required using FFT is N/2log2N. If N=16, the number of complex multiplications
required for direct evaluation of DFT is 256, whereas using DFT only 32 multiplications are
required.

18. What is the speed of improvement factor in calculating 64-point DFT of a sequence using
direct computation and computation and FFT algorithms?
Or
Calculate the number of multiplications needed in the calculation of DFT and FFT with 64-
point sequence.
The number of complex multiplications required using direct computation is
N2=642=4096.
The number of complex multiplications required using FFT is
N/2 log2N = 64/2log264=192.
Speed improvement factor = 4096/192=21.33
19. What is the main advantage of FFT?

FFT reduces the computation time required to compute discrete Fourier transform.
20. Calculate the number of multiplications needed in the calculation of DFT using FFT algorithm
with using FFT algorithm with 32-point sequence.
For N-point DFT the number of complex multiplications needed using FFT algorithm is
N/2 log2N.
For N=32, the number of the complex multiplications is equal to 32/2log232=16*5=80.
21. What is FFT?

The fast Fourier transforms (FFT) is an algorithm used to compute the DFT. It makes use of the
Symmetry and periodically properties of twiddles factor WKN
to effectively reduce the DFT computation time. It is based on the fundamental principle of
decomposing the computation of the DFT of a sequence of length N into successively smaller
discrete Fourier transforms. The FFT algorithm provides speed-increase factors, when compared
with direct computation of the DFT, of approximately 64 and 205 for 256-point and 1024-point
transforms, respectively.

22. How many multiplications and additions are required to compute N-point DFT using redix-2
FFT?
The number of multiplications and additions required to compute N-point DFT using redix-2 FFT are
N log2N and N/2 log2N respectively.
23. What is meant by radix-2 FFT?

The FFT algorithm is most efficient in calculating N-point DFT. If the number of output points N can
be expressed as a power of 2, that is, N=2M, where M is an integer, Then this algorithm is known as
radix-s FFT algorithm.
24. What is a decimation-in-time algorithm?

Decimation-in-time algorithm is used to calculate the DFT of a N-point Sequence. The idea is to
break the N-point sequence into two sequences, the DFTs of which can be combined to give the DFT
of the original N-point sequence. Initially the N-point sequence is divided into two N/2-point
sequences xe(n) and x0(n), which have the even and odd members of x(n) respectively. The N/2
point DFTs of these two sequences are evaluated and combined to give the N point DFT. Similarly
the N/2 point DFTs can be expressed as a combination of N/4 point DFTs. This process is continued
till we left with 2-point DFT. This algorithm is called Decimation-in-time because the sequence x(n)
is often splitted into smaller sub sequences.
25. What are the differences and similarities between DIF and DIT algorithms?
Differences:
1. For DIT, the input is bit reversal while the output is in natural order, whereas for DIF, the
input is in natural order while the output is bit reversed.
2. The DIF butterfly is slightly different from the DIT butterfly, the difference being that the
complex multiplication takes place after the add-subtract operation in DIF.
Similarities:
Both algorithms require same number of operations to compute the DFT. Both algorithms
can be done in place and both need to perform bit reversal at some place during the computation.
26. How can we calculate IDFT using FFT algorithm?

The inverse DFT of an N point sequence X(K) is defined as
If we take complex conjugate and multiply by N, we get

The right hand side of the above equation is DFT of the sequence X*(K) and may be computed using
any FFT algorithm. The desired output sequence x (n) can be then obtained by complex conjugating
the DFT of the above equation and dividing by N to give
27. What are the applications of FFT algorithms?

1. Linear filtering
2. Correlation
3. Spectrum analysis
28. Draw the 4-point radix-2 DIT-FFT butterfly structure for DFT.
29. Draw the 4-point radix-2 DIF-FFT butterfly structure for DFT.
30. Draw the basic butterfly diagram for DIT, DIF algorithm.

31. What is a decimation-in-frequency algorithm?

In this the output sequence X (K) is divided into two N/2 point sequences and each N/2 point
sequences are in turn divided into two N/4 point sequences.
32. Distinguish between DFT and DTFT.
S.No DFT DTFT

1. Obtained by performing sampling Sampling is performed only in time
operation in both the time and domain.
frequency domains.
Discrete frequency spectrum

Continuous function of
2.
33. Distinguish between Fourier series and Fourier transform.
S.No. Fourier Series Fourier transform

1 Gives the harmonic content of a periodic Gives the frequency information for an
time function. aperiodic signal.
Discrete frequency spectrum Continuous frequency spectrum

2.
DIGITAL SIGNAL PROCESSING

UNIT-II
IIR FILTER DESIGN

1) Define IIR filter?
IIR filter has Infinite Impulse Response.
2) What are the various methods to design IIR filters?

Approximation of derivatives

Impulse invariance
Bilinear transformation.
3) Which of the methods do you prefer for designing IIR filters? Why?
Bilinear transformation is best method to design IIR filter, since there is no aliasing in it.
4) What is the main problem of bilinear transformation?

Frequency warping or nonlinear relationship is the main problem of bilinear transformation.
5) What is prewarping?
Prewarping is the method of introducing nonlinearly in frequency relationship to
compensate warping effect.
6) State the frequency relationship in bilinear transformation?

= 2 tan (w/2)
7) Where the j axis of s-plane is mapped in z-plane in bilinear transformation?

The j axis of s-plane is mapped on the unit circle in z-plane in bilinear transformation
8) Where left hand side and right hand side are mapped in z-plane in bilinear transformation?
Left hand side -- Inside unit circle
Right hand side Outside unit circle
9) What is the frequency response of Butterworth filter?

Butterworth filter has monotonically reducing frequency response.
10) Which filter approximation has ripples in its response?

Chebyshev approximation has ripples in its pass band or stop band.

11) Can IIR filter be designed without analog filters?

Yes. IIR filter can be designed using pole-zero plot without analog filters
12) What is the advantage of designing IIR Filters using pole-zero plots?
The frequency response can be located exactly with the help of poles and zeros.
13) What is the equation for order of Butterworth filter?
14) Write equations for transfer functions of Chebyshev filter and Butterworth filter.
15) What are the equations of lowpass to lowpass & lowpass to highpass transformation?
16) Pole-zero plot of the filter is given in fig.1. Determine its difference equation.

17) What is the transformation used for impulse invariance?
18) Why frequency alaising occurs in impulse invariance?

19) Obtain impulse invariance transformation for H(s) = 1 / (s+1)
20) What is the transformation used in Bilinear transformation?
21) What is an equation for prewarping?

22) Compare the digital and analog filter.

Digital filter Analog filter
i) Operates on digital samples of the signal. i) Operates on analog signals.
ii) It is governed by linear difference equation. ii) It is governed by linear difference equation.
iii) It consists of adders, multipliers and delays

implemented in digital logic.
iii) It consists of electrical components like
iv) In digital filters the filter coefficients are resistors, capacitors and inductors.
designed to satisfy the desired frequency
iv) In digital filters the approximation problem
response.
is solved to satisfy the desired frequency
response.
23) What are the advantages and disadvantages of digital filters?
Advantages of digital filters

High thermal stability due to absence of resistors, inductors and capacitors.
Increasing the length of the registers can enhance the performance characteristics like
accuracy, dynamic range, stability and tolerance.
The digital filters are programmable.
Multiplexing and adaptive filtering are possible.
Disadvantages of digital filters

The bandwidth of the discrete signal is limited by the sampling frequency.
The performance of the digital filter depends on the hardware used to implement the
filter.
24) What is impulse invariant transformation?

The transformation of analog filter to digital filter without modifying the impulse response of the
filter is called impulse invariant transformation.

25) Obtain the impulse response of digital filter to correspond to an analog filter with impulse
response ha(t) = 0.5 e-2t and with a sampling rate of 1.0kHz using impulse invariant method.
26) How analog poles are mapped to digital poles in impulse invariant transformation?
In impulse invariant transformation the mapping of analog to digital poles are as follows,
The analog poles on the left half of s-plane are mapped into the interior of unit circle in
z-plane.
The analog poles on the imaginary axis of s-plane are mapped into the unit circle in the
z-plane.
The analog poles on the right half of s-plane are mapped into the exterior of unit circle
in z-plane.
27) What is the importance of poles in filter design?

The stability of a filter is related to the location of the poles. For a stable analog filter the
poles should lie on the left half of s-plane. For a stable digital filter the poles should lie inside the
unit circle in the z-plane.
28) Why an impulse invariant transformation is not considered to be one-to-one?

In impulse invariant transformation any strip of width 2/T in the s-plane for values of s-
plane in the range (2k-1)/T (2k-1) /T is mapped into the entire z-plane. The left half of
each strip in s-plane is mapped into the interior of unit circle in z-plane, right half of each
strip in s-plane is mapped into the exterior of unit circle in z-plane and the imaginary axis of
each strip in s-plane is mapped on the unit circle in z-plane. Hence the impulse invariant
transformation is many-to-one.
29) Given that, Ha(s) = 1 / (s +1). By impulse invariant method, obtain the digital transfer function
and the difference equation of digital filter.

30) Write the impulse invariant transformation used to transform real poles with and without
multiplicity.

31) Write the impulse invariant transformation used to transform complex conjugate poles.
32) What is Bilinear transformation?

The bilinear transformation is conformal mapping that transforms the s-plane to z-plane. In this
mapping the imaginary axis of s-plane is mapped into the unit circle in z-plane, The left half of s-
plane is mapped into interior of unit circle in z-plane and the right half of s-plane is mapped into
exterior of unit circle in z-plane. The Bilinear mapping is a one-to-one mapping and it is
accomplished when
33) Sketch the mapping of s plane to z plane in bilinear transformation.

34) What is the relationship between digital and analog frequency in Bilinear transformation?
Bilinear transformation the digital frequency is given by,
Digital frequency, w =
Where, = Analog frequency, and T = Sampling time period.
35) How Bilinear transformation is performed?
36) How the analog frequency is mapped to digital frequency in bilinear transformation?

37) How the order of the filter affects the frequency response of Butterworth filter.
The magnitude response of butterworth filter is shown in figure, from which it can be observed
that the magnitude response approaches the ideal response as the order of the filter is increased.
38) Write the transfer function of unnormalized butterworth lowpass filter.

39) How will you choose the order N for a butterworth filter.
40) Sketch the magnitude response of Type 1 chebyshev filters.

41) Sketch the magnitude response of Type 2 chebyshev filters.
42) Write the properties of Chebyshev type 1 filters.

The magnitude response is equiripple in the passband and monotonic in the stopband.
The chebyshev type-1 filters are all pole designs.
The normalized magnitude function has a value of at the cutoff frequency
c .
The magnitude response approaches the ideal response as the value of N increases.
43) Compare the Butterworth and Chebyshev Type-1 filters.

Butterworth Chebyshev Type - 1
i. All pole design. i. All pole design.
ii. The poles lie on a circle in s-plane. ii. The poles lie on a ellipse in s-plane.
iii. The magnitude response is maximally flat iii. The magnitude response is equiripple in
at the origin and monotonically decreasing passband and monotonically decreasing in the

function of . stopband.
iv. The normalized magnitude response has a iv. The normalized magnitude response has a
value of 1 / 2 at the cutoff frequency c. value of 1 / (1+ 2) at the cutoff frequency c.
v. Only few parameters has to be calculated to v. A large number of parameters has to be

determine the transfer function. calculated to determine the transfer function.

FIR FILTER DESIGN
1. What is FIR filters?

The specifications of the desired filter will be given in terms of ideal frequency response
Hd(w). The impulse response hd(n) of the desired filter can be obtained by inverse fourier
transform of Hd(w), which consists of infinite samples. The filters designed by selecting finite
number of samples of impulse response are called FIR filters.
2. What are the different types of filters based on impulse response?

Based on impulse response the filters are of two types 1. IIR filter 2. FIR filter
The IIR filters are of recursive type, whereby the present output sample depends on the
present input, past input samples and output samples.
The FIR filters are of non recursive type, whereby the present output sample depends on the
present input, and previous output samples.
3. What are the different types of filter based on frequency response?

The filters can be classified based on frequency response. They are I) Low pass filter ii) High
pass filter iii) Band pass filter iv) Band reject filter.
4. Distinguish between FIR and IIR filters.

S.No. FIR filter IIR filter

1. These filters can be easily designed to These filters do not have linear phase.
have perfectly linear phase.
FIR filters can be realized recursively and

2. IIR filters can be realized recursively.
non-recursively.
Greater flexibility to control the shape of

3. their magnitude response. Less flexibility, usually limited to kind of
filters.
Errors due to roundoff noise are less
severe in FIR filters, mainly because The roundoff noise in IIR filters are more.
4. feedback is not used.
5. What are the techniques of designing FIR filters?

There are three well-known methods for designing FIR filters with linear phase. These are 1)
windows method 2) Frequency sampling method 3) Optimal or minimax design.
6. State the condition for a digital filter to be causal and stable.

A digital filter is causal if its impulse response h(n) = 0 for n<0
A digital filter is stable if its impulse response is absolutely summable,
7. What is the reason that FIR filter is always stable?

FIR filter is always stable because all its poles are at origin.
8. What are the properties of FIR filter?

1. FIR filter is always stable.
2. A realizable filter can always be obtained.
3. FIR filter has a linear phase response.
9. How phase distortion and delay distortions are introduced?

The phase distortion is introduced when the phase characteristics of a filter is not linear
within the desired frequency band.
The delay distortion is introduced when the delay is not constant within the desired
frequency range.
10. Write the steps involved in FIR filter design.

Choose the desired (ideal) frequency response Hd(w).
Take inverse fourier transform of Hd(w) to get hd(n).
Convert the infinite duration hd(n) to finite duration h(n).
Take Z-transform of h(n) to get the transfer function H(z) of the FIR filter.
11. What are the advantages of FIR filters?

Linear phase FIR filter can be easily designed.
Efficient realization of FIR filter exist as both recursive and nonrecursive structures.
FIR filters realized nonrecursively are always stable.
The round off noise can be made small in nonrecursive realization of FIR filters.
12. What are the disadvantages of FIR filters?

The duration of impulse response should be large to realize sharp cutoff filters.
The non-integral delay can lead to problems in some signal processing applications.
13. What is the necessary and sufficient condition for the linear phase characteristic of an FIR
filter?
The necessary and sufficient condition for the linear phase characteristic of an FIR filter is that the phase function should be a linear
function of w, which in turn requires constant phase and group delay.
14. What are the conditions to be satisfied for constant phase delay in linear phase FIR filters?
The conditions for constant phase delay ARE
Phase delay, = (N-1)/2 (i.e., phase delay is constant)
Impulse response, h(n) = -h(N-1-n) (i.e., impulse response is antisymmetric)
15. How constant group delay & phase delay is achieved in linear phase FIR filters?
The following conditions have to be satisfied to achieve constant group delay & phase delay.

Phase delay, = (N-1)/2 (i.e., phase delay is constant)
Group delay, = /2 (i.e., group delay is constant)
Impulse response, h(n) = -h(N-1-n) (i.e., impulse response is antisymmetric)
16. What are the possible types of impulse response for linear phase FIR filters?
There are four types of impulse response for linear phase FIR filters
Symmetric impulse response when N is odd.

Symmetric impulse response when N is even.
Antisymmetric impulse response when N is odd.
Antisymmetric impulse response when N is even.
17. List the well-known design techniques of linear phase FIR filters.
There are three well-known design techniques of linear phase FIR filters. They are
Fourier series method and window method

Frequency sampling method.
Optimal filter design methods.
18. What is Gibbs phenomenon (or Gibbs Oscillation)?

In FIR filter design by Fourier series method the infinite duration impulse response is truncated
to finite duration impulse response. The abrupt truncation of impulse response introduces
oscillations in the passband and stopband. This effect is known as Gibbs phenomenon (or Gibbs
Oscillation).
19. Draw the direct form realization of FIR system.

20. Draw the direct form realization of a linear phase FIR system for N is odd.
21. Draw the direct form realization of a linear phase FIR system for N is even.
22. When cascade form realization is preferred in FIR filters?

The cascade form realization is preferred when complex zeros with absolute magnitude
less than one.

23. What are the desirable characteristics of the frequency response of window function?
The desirable characteristics of the frequency response of window function are
The width of the mainlobe should be small and it should contain as much of the total
energy as possible.
The sidelobes should decrease in energy rapidly as w tends to .
24. Write the procedure for designing FIR filter using frequency-sampling method.
Choose the desired (ideal) frequency response Hd(w).
Take N-samples of Hd(w) to generate the sequence
Take inverse DFT of to get the impulse response h(n).
The transfer function H(z) of the filter is obtained by taking z-transform of impulse
response.
25. What are the drawback in FIR filter design using windows and frequency sampling method?
How it is overcome?
The FIR filter design using windows and frequency sampling method does not have
Precise control over the critical frequencies such as wp and ws.
This drawback can be overcome by designing FIR filter using Chebyshev approximation
technique. In this technique an error function is used to approximate the ideal frequency
response, in order to satisfy the desired specifications.
26. Write the expression for frequency response of rectangular window and sketch the magnitude
response.
27. Write the characteristic features of rectangular window.

The mainlobe width is equal to 4/N.
The maximum sidelobe magnitude is 13dB.
The sidelobe magnitude does not decrease significantly with increasing w.

28. List the features of FIR filter designed using rectangular window.
The width of the transition region is related to the width of the mainlobe of window
spectrum.
Gibbs oscillations are noticed in the passband and stopband.
The attenuation in the stopband is constant and cannot be varied.
29. Why Gibbs oscillations are developed in rectangular window and how it can be eliminated or
reduced?
The Gibbs oscillations in rectangular window are due to the sharp transitions from 1 to 0 at
the edges of window sequence.
These oscillations can be eliminated or reduced by replacing the sharp transition by

gradual transition. This is the motivation for development of triangular and cosine windows.
30. List the characteristics of FIR filters designed using windows.

The width of the transition band depends on the type of window.
The width of the transition band can be made narrow by increasing the value of N
where N is the length of the window sequence.
The attenuation in the stop band is fixed for a given window, except in case of Kaiser
window where it is variable.
31. Write the frequency response of hamming window.
32. Write the frequency response of hamming window.

33. Give the equation for hamming window function.
34. Compare the rectangular window and hamming window.

Rectangular window Hamming Window
i) The width of main lobe in window i) The width of main lobe in window
spectrum is 4/N spectrum is 8/N
ii) The maximum side lobe magnitude in ii) The maximum side lobe magnitude in
window spectrum is 13dB. window spectrum is 31dB.
iii) In window spectrum the side lobe iii) In window spectrum the side lobe
magnitude slightly decreases with increasing magnitude decreases with increasing w.
w.
iv) In FIR filter designed using hamming
iv) In FIR filter designed using rectangular window the minimum stop band attenuation
window the minimum stop band attenuation is 44dB.
is 22dB.
35. Write the equation for hamming window function.
36. Compare the rectangular window and hamming window.

Rectangular window Hamming Window
i) The width of mainlobe in window i)The width of mainlobe in window

spectrum is 4/N spectrum is 8/N
ii) The maximum sidelobe magnitude in ii) The maximum sidelobe magnitude in
window spectrum is 13dB. window spectrum is 41dB.

iii) In window spectrum the sidelobe iii) In window spectrum the sidelobe
magnitude slightly decreases with increasing magnitude remains constant.
w.
iv) In FIR filter designed using hamming
iv) In FIR filter designed using rectangular window the minimum stopband attenuation
window the minimum stopband attenuation is 44dB.
is 22dB.
37. Write the characteristic features of hanning window spectrum.

The mainlobe width is equal to 8/N.
The maximum sidelobe magnitude is 41dB.
The sidelobe magnitude remains constant for increasing w.
38. What is the mathematical problem involved in the design of window function?
The mathematical problem involved in the design of window function(or sequence) is
that of finding a time-limited function whose Fourier Transform best approximates a band
limited function. The approximation should be such that the maximum energy is confined to
mainlobe for a given peak sidelobe amplitude.
39. Write the expression for Kaiser window function.
40. List the desirable features of Kaiser window spectrum.

The width of the mainlobe and the peak sidelobe are variable.
The parameter in the Kaiser window function is an independent variable that can be
varied to control the sidelobe levels with respect to mainlobe peak.

The width of the mainlobe in the window spectrum can be varied by varying the length
N of the window sequence.
41. Compare the hamming window and Kaiser window.

Hamming Window Kaiser Window
i)The width of mainlobe in window i) The width of mainlobe in window

spectrum is 8/N spectrum depends on the values of &
ii) The maximum sidelobe magnitude in N.
window spectrum is 41dB. ii) The maximum sidelobe magnitude with
respect to peak of mainlobe is variable using
iii) In window spectrum the sidelobe the parameter .
magnitude remains constant.
iii) In window spectrum the sidelobe
iv) In FIR filter designed using hamming magnitude decreases with increasing w.
window the minimum stopband attenuation is
44dB. iv) In FIR filter designed using Kaiser window
the minimum stopband attenuation is variable
and depends on the value of .
UNIT III
FINITE WORD LENGTH EFFECTS
1. What do finite word length effects mean?

The effects due to finite precision representation of numbers in a digital system
are called finite word length effects.
2. List some of the finite word length effects in digital filters.

1. Errors due to quantization of input data.
2. Errors due to quantization of filter co-efficient
3. Errors due to rounding the product in multiplications
4. Limit cycles due to product quantization and overflow in addition.
3. What are the different formats of fixed-point representation?

a. Sign magnitude format
b. Ones Complement format
c. Twos Complement format.

In all the three formats, the positive number is same but they differ only in
representing negative numbers.
4. Explain the floating-point representation of binary number.

The floating-point number will have a mantissa part. In a given word size the bits allotted
for mantissa and exponent are fixed. The mantissa is used to represent a binary fraction
number and the exponent is a positive or negative binary integer. The value of the
exponent can be adjusted to move the position of binary point in mantissa. Hence this
representation is called floating point.
5. What are the types of arithmetic used in digital computers?

The floating point arithmetic and twos complement arithmetic are the two types of
arithmetic employed in digital systems.
6. What are the two types of quantization employed in digital system?

The two types of quantization in digital system are Truncation and Rounding.
7. What is truncation?
The truncation is the process of reducing the size of binary number by discarding all bits
less significant than the least significant bit that is retained. In truncation of a binary
number of b bits all the less significant bits beyond bth bit are discarded.
8. What is rounding?
Rounding is the process of reducing the size of a binary number to finite word size of b-bits
such that, the rounded b-bit number is closest to the original unquantized number.
9. Explain the process of upward rounding?

In upward rounding of a number of b-bits, first the number is truncated to b-bits by
retaining the most significant b-bits. If the bit next to the least significant bit that is
retained is zero, then zero is added to the least significant bit of the truncated number. If
the bit next to the least significant bit that is retained is one then one is added to the least
significant bit of the truncated number.
10. What are the errors generated by A/D process?

The A/D process generates two types of errors. They are quantization error and
saturation error. The quantization error is due to representation of the sampled
signal by a fixed number of digital levels. The saturation errors occur when the
analog signal exceeds the dynamic range of A/D converter.
11. What is quantization step size?

In digital systems, the numbers are represented in binary. With b-bit binary we
can generate 2b different binary codes. Any range of analog value to be
represented in binary should be divided into 2b levels with equal increment. The
2b levels are called quantization levels and the increment in each level is called
quantization step size. If R is the range of analog signal then,
Quantization step size, q = R/2b
12. Why errors are created in A/D process?

In A/D process the analog signals are sampled and converted to binary. The
sampled analog signal will have infinite precision. In binary representation of b-
bits we have different values with finite precision. The binary values are called
quantization levels. Hence the samples of analog are quantized in order to fit into
any one of the quantized levels. This quantization process introduces errors in the
signal.
13. What is steady state output noise power due to input quantization?
The input signal to digital system can be considered as a sum of unquantized signal
and error signal due to input quantization. The response of the system can be
expressed as a summation of response due to unquantized input and error signal.
The response of the system due to error signal is given by convolution of error
signal and impulse response. The variance of response of the system for error
signal is called state output noise power.
14. What is meant by coefficient inaccuracy?

In digital computation the filter coefficients are represented in binary. With b-bit
binary we can generate only 2b different binary numbers and they are called
quantization levels. Any filter coefficient has to be fitted into any one of the
quantizat6ion levels. Hence the filter coefficients are quantized to represent in
binary and the quantizatiion introduces errors in filter coefficients. Therefore the
coefficients cannot be accurately represented in a digital system and this problem
is referred to as coefficient inaccuracy.

15. How the digital filter is affected by quantization of filter coefficients?

The quantization of the filter coefficients will modify the value of poles & zeros and
so the location of poles and zeros will be shifted from the desired location. This
will create deviations in the frequency response of the system. Hence the
resultant filter will have a frequency response different from that of the filter with
unquantized coefficients.
16. How the sensitivity of frequency response to quantization of filter coefficients is

minimized?
The sensitivity of the filter frequency response to quantization of the filter
coefficients is minimized by realizing the filter having a large number of poles and
zeros as an interconnection of second order sections. Hence the filter can be
realized in cascade or parallel form, in which the basic buildings blocks are first
order and second order sections.
17. What is meant by product quantization error?

In digital computations, the output of multipliers i.e., the product are quantized to
finite word length in order to store them in registers and to be used in subsequent
calculations. The error due to the quantization of the output of multiplier is
referred to as product quantization error.
18. Why rounding is preferred for quantizing the product?

In digital system rounding due to the following desirable characteristic of rounding
performs the product quantization
1. The rounding error is independent of the type of arithmetic
2. The mean value of rounding error signal is zero.
3. The variance of the rounding error signal is least.
19. Define noise transfer function (NTF)?

The Noise Transfer Function is defined as the transfer function from the noise
source to the filter output. The NTF depends on the structure of the digital
networks.
20. What are the assumptions made regarding the statistical independence of the
various noise sources in the digital filter?

The assumptions made regarding the statistical independence of the noise sources
are,
1. Any two different samples from the same noise source are uncorrelated.
2. Any two different noise source, when considered, as random processes are
uncorrelated.
3. Each noise source is uncorrelated with the input sequence.
21. What are limit cycles?

In recursive systems when the input is zero or some nonzero constant value, the
nonlinearities die to finite precision arithmetic operations may cause periodic
oscillations in the output. These oscillations are called limit cycles.
22. What are the two types of limit cycles?

The two types of limit cycles are zero input limit cycles and overflow limit cycles.
23. What is zero input limit cycles?

In recursive system, the product quantization may create periodic oscillations in
the output. These oscillations are called limit cycles. If the system output enters a
limit cycles, it will continue to remain in limit cycles even when the input is made
zero. Hence these limit cycles are also called zero input limit cycles.
24. What is dead band?

In a limit cycle the amplitudes of the output are confined to a range of values,
which is called dead band of the filter.
25. How the system output cam be brought out of limit cycles?
The system output can be brought out of limit cycle by applying an input of large
magnitude, which is sufficient to drive the system out of limit cycle.
26. What is saturation arithmetic?

In saturation arithmetic when the result of an arithmetic operation exceeds the

dynamic range of number system, then the result is set to maximum or minimum
possible value. If the upper limit is exceeded then the result is set to maximum
possible value. If the lower limit is exceeded then the r4esult is set to minimum
possible value.
27. What is overflow limit cycle?

In fixed point addition the overflow occurs when the sum exceeds the finite word
length of the register used to store the sum. The overflow in addition may lead to
oscillations in the output which is called overflow limit cycles.
28. How overflow limit cycles can be eliminated?

The overflow limit cycles can be eliminated either by using saturation arithmetic or
by scaling the input signal to the adder.
29. What is the drawback in saturation arithmetic?

The saturation arithmetic introduces nonlinearity in the adder which creates signal
distortion.

UNIT V
DIGITAL SIGNAL PROCESSOR
1. Write short notes on general purpose DSP processors

General-purpose digital signal processors are basically high speed microprocessors with
hard ware architecture and instruction set optimized for DSP operations. These processors
make extensive use of parallelism, Harvard architecture, pipelining and dedicated hardware
whenever possible to perform time consuming operations
2. Write notes on special purpose DSP processors.

There are two types of special; purpose hardware.
(i) Hardware designed for efficient execution of specific DSP algorithms such as
digital filter, FFT.
(ii) Hardware designed for specific applications, for example telecommunication,
digital audio.
3. Briefly explain about Harvard architecture.

The principal feature of Harvard architecture is that the program and the data memories lie
in two separate spaces, permitting full overlap of instruction fetch and execution.
Typically these types of instructions would involve their distinct type.
1. Instruction fetch
2. Instruction decode
3. Instruction execute

4. Briefly explain about multiplier accumulator.
The way to implement the correlation and convolution is array multiplication
Method.
For getting down these operations we need the help of adders and multipliers. The
combination of these accumulator and multiplier is called as multiplier accumulator.
5. What are the types of MAC is available?
There are two types MACS available
1. Dedicated & integrated

2. Separate multiplier and integrated unit
6. What is meant by pipeline technique?

The pipeline technique is used to allow overall instruction executions to overlap. That is
where all four phases operate in parallel. By adapting this technique, execution speed is
increased.
7. What are four phases available in pipeline technique?

The four phases are
(i) Fetch
(ii) Decode
(iii) Read
(iv) Execution

8. In a non-pipeline machine, the instruction fetch, decode and execute take 30 ns, 45 ns
and 25 ns respectively. Determine the increase in throughput if the instruction were pipelined.
Assume a 5ns pipeline overhead in each stage and ignore other delays.
The average instruction time is = 30 ns+45 ns + 25 ns = 100 ns
Each instruction has been completed in three cycles = 45 ns * 3 = 135ns
Throughput of the machine =
The average instruction time/Number of M/C per instruction
= 100/135 = 0.7407
But in the case of pipeline machine, the clock speed is determined by the speed of the slowest stage
plus overheads.
In our case is = 45 ns + 5 ns =50 ns
The respective throughput is = 100/50 = 2.00
The amount of speed up the operation is = 135/50 = 2.7 times
9.Assume a memory access time of 150 ns, multiplication time of 100 ns, addition time of 100
ns and overhead of 10 ns at each pipe stage. Determine the throughput of MAC
After getting successive addition and multiplications
The total time delay is 150 + 100 + 100 + 5 = 355 ns
System throughput is = 1/355 ns.
10.Write down the name of the addressing modes.
Direct addressing.
Indirect addressing.
Bit-reversed addressing.
Immediate addressing.
i. Short immediate addressing.

ii. Long immediate addressing.
Circular addressing.

11.What are the instructions used for block transfer in C5X Processors?
The BLDD, BLDP and BLPD instructions use the BMAR to point at the source or
destination space of a block move. The MADD and MADS also use the BMAR to address
an operand in program memory for a multiply accumulator operation
12.Briefly explain about the dedicated register addressing modes.
The dedicated-registered addressing mode operates like the long immediate

addressing modes, except that the address comes from one of two special-purpose
memory-mapped registers in the CPU: the block move address register (BMAR) and the
dynamic bit manipulation register (DBMR).
The advantage of this addressing mode is that the address of the block of
memory to be acted upon can be changed during execution of the program.
13. Briefly explain about bit-reversed addressing mode?

In the bit-reversed addressing mode, INDX specifies one-half the size of the FFT. The
value contained in the current AR must be equal to 2n-1, where n is an integer, and the
FFT size is 2n. An auxiliary register points to the physical location of a data value. When
we add INDX t the current AR using bit reversed addressing, addresses are generated in
a bit-reversed fashion. Assume that the auxiliary registers are eight bits long, that AR2
represents the base address of the data in memory (0110 00002), and that INDX
contains the value 0000 10002.
14. Briefly explain about circular addressing mode.

Many algorithms such as convolution, correlation, and finite impulse response (FIR)
filters can use circular buffers in memory to implement a sliding window; which contains
the most recent data to be processed. The C5x supports two concurrent circular buffer
operating via the ARs. The following five memory-mapped registers control the circular
buffer operation.
1. CBSR1- Circular buffer 1 start register.

2. CBSR2- Circular buffer 2 start Register,
3. CBER1- Circular buffer 1 end register

4. CBER2- Circular buffer 2 end register

5. CBCR - Circular buffer control register.
15. Write the name of various part of C5X hardware.

1. Central arithmetic logic unit (CALU)
2. Parallel logic unit (PLU)
3. Auxiliary register arithmetic unit (ARAU)
4. Memory-mapped registers.
5. Program controller.
16. Write short notes about arithmetic logic unit and accumulator.
The 32-bit general-purpose ALU and ACC implement a wide range of arithmetic and
logical functions, the majority of which execute in a single clock cycle. Once an
operation is performed in the ALU, the result is transferred to the ACC, where additional
operations, such as shifting, can occur. Data that is input to the ALU can be scaled by
the prescaler.
The following steps occur in the implementation of a typical ALU instruction:
1. Data is fetched from memory on the data bus,

2. Data is passed through the prescaler and the ALU, where the arithmetic is
performed, and
3. The result is moved into the ACC.
The ALU operates on 16-bit words taken from data memory or derived from immediate
instructions. In addition to the usual arithmetic instructions, the ALU can perform
Boolean operations, thereby facilitating the bit manipulation ability required of high-
speed controller. One input to the ALU is always supplied by the ACC. The other input
can be transferred from the PREG of the multiplier, the ACCB, or the output of the
prescaler. After the ALU has performed the arithmetic or logical operation, the result is
stored in the ACC.
17. Write short notes about parallel logic unit.

The parallel logic unit (PLU) can directly set, clear, test, or toggle multiple bits in
control/status register pr any data memory location. The PLU provides a direct logic
operation path to data memory values without affecting the contents of the ACC or the
PREG.
18. What is meant by auxiliary register file?

The auxiliary register file contains eight memory-mapped auxiliary registers (AR0-AR7),
which can be used for indirect addressing of the data memory or for temporary data

storage. Indirect auxiliary register addressing allows placement of the data memory
address of an instruction operand into one of the AR. The ARs are pointed to by a 3-bit
auxiliary register pointer (ARP) that is loaded with a value from 0-7, designating AR0-
AR7, respectively.
19. Write short notes about circular registers in C5X.

The C5x devices support two concurrent circular buffers operating in conjunction with
user-specified auxiliary register. Two 16-bit circular buffer start registers (CBSR1 and
CBSR2) indicate the address where the circular buffer starts. Two 16-bit circular buffer
end registers (CBER1 and CBER2) indicate the address where the circular buffer ends.
The 16-bit circular buffer control register (CBCR) controls the operation of these circular
buffers and identifies the auxiliary registers to be used.

0

DSP Answers PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DSP Answers PDF

Uploaded by

Copyright:

Available Formats

www.Vidyarthiplus.

EC1302 DIGITAL SIGNAL PROCESSING 3 1 0 100

UNIT II DIGITAL FILTERS DESIGN 9

UNIT III FINITE WORD LENGTH EFFECTS 9

UNIT IV POWER SPECTRUM ESTIMATION 9

UNIT V DIGITAL SIGNAL PROCESSORS 9

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 21

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 25

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 27

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 29

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 30

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 31

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 33

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 35

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 37

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 39

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 41

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 43

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 45

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 47

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 49

UNIT 1 INTRODUCTION TO FFT

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 58

2. Define N point DFT.

Since this summation is taken for N points, it is called as N-point DFT.

3. What is DFT of unit impulse (n)?

4. List the properties of DFT.

5. State Linearity property of DFT.

6. What is the Periodicity property of DFT?

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 59

7. When a sequence is called circularly even?

8. What is the condition of a sequence to be circularly odd?

9. Why the result of circular and linear convolution is not same?

Where L= Number of samples in x (n)

M=Number of samples in h (n)

10. What is circular time shift of sequence?

11. What is the disadvantage of direct computation of DFT?

1. Radix-2 FFT algorithms.

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 60

-Radix-2 Decimation in Time (DIT) algorithm.

- Radix-2 Decimation in Frequency (DIF) algorithm.

13. What is the computational complexity using FFT algorithm?

14. How linear filtering is done using FFT?

15. What is zero padding? What are its uses?

(i) We can get better display of the frequency spectrum.

16. Define Circular convolution.

17. Why FFT is needed?

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 61

The number of complex multiplications required using direct computation is

The number of complex multiplications required using FFT is

N/2 log2N = 64/2log264=192.

Speed improvement factor = 4096/192=21.33

19. What is the main advantage of FFT?

For N=32, the number of the complex multiplications is equal to 32/2log232=16*5=80.

21. What is FFT?

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 62

23. What is meant by radix-2 FFT?

24. What is a decimation-in-time algorithm?

26. How can we calculate IDFT using FFT algorithm?

If we take complex conjugate and multiply by N, we get

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 63

27. What are the applications of FFT algorithms?

www.Vidyarthiplus.com EC2302 DIGITAL SIGNAL PROCESSING 64