dsp courseplan

8
COURSE PLAN SUBJECT NAME : DIGITAL SIGNAL PROCESSING FACULTY NAME : Dr.M.Pallikonda.Rajasekaran, Professor/ECE Contents 1. Pre-requisite 2. Objective 3. Learning outcome and end use 4. Lesson Plan with Reference Book, Web Resources 5. Portion for Sessional-I,II 6. Details of Assignments-I,II,III,IV,V,VI 7. Details of Tutorials 8. Seminar Topics 9. Additional topics 10. Related books & Magazines 11. Related Experiments DEPARTMENT OF INSTUMENTAION & CONTROL ENGINEERING KALASALINGAM UNIVERSITY (Kalasalingam Academy of Research and Education) Anand Nagar, krishnankoil - 626 190. Tamil Nadu, INDIA

Upload: ariel-mendoza

Post on 09-Apr-2016

217 views

Category:

Documents


2 download

DESCRIPTION

DSP Courseplan

TRANSCRIPT

Page 1: DSP Courseplan

COURSE PLAN

SUBJECT NAME : DIGITAL SIGNAL PROCESSING

FACULTY NAME : Dr.M.Pallikonda.Rajasekaran, Professor/ECE

Contents

1. Pre-requisite

2. Objective

3. Learning outcome and end use

4. Lesson Plan with Reference Book, Web Resources

5. Portion for Sessional-I,II

6. Details of Assignments-I,II,III,IV,V,VI

7. Details of Tutorials

8. Seminar Topics

9. Additional topics

10. Related books & Magazines

11. Related Experiments

DEPARTMENT OF INSTUMENTAION & CONTROL ENGINEERING

KALASALINGAM UNIVERSITY

(Kalasalingam Academy of Research and Education)

Anand Nagar, krishnankoil - 626 190. Tamil Nadu, INDIA

Page 2: DSP Courseplan

1. Pre-requisite:

a. Fundamentals of Fourier Transform & Fourier series.

2. Objectives :

1. To have an overview of signals and systems.

2. To study DFT & FFT

3. To study the design of IIR filters.

4. To study the design of FIR filters.

5. To study the effect of finite word lengths & applications of DSP

3. Learning outcome and end use: Upon completion of this course, students will be able to:

1. Describe and analyze discrete time signals in the time domain and frequency

domain.

2. Apply digital signal processing techniques to analyze discrete time signals and

systems

3. Apply digital signal processing techniques to design discrete time systems

4. Solve digital signal processing problems using Matlab.

5. Design and apply digital filters

6. Knowledge about Signal processing, Architecture, Programming of TMS320C50

& ADSP kit.

4. REFERENCE BOOK :

� R1.Openheim A.V., and Shaefer R.W., Discrete Time Signal Processing, Prentice

Hall, NJ, 1980.

� R2.Proakis J.G. and Manolakis, D.G., Introduction to Digital Signal Processing,

Maxwell Macwilliam International Edition, London, 1989.

� R3.Antonian A., Digital Filters analysis and Design, Tata McGraw Hill Publishing

Co., New Delhi, 198.

� R4.Stanley W.D., Digital Signal Processing, Restion Publishing House, 1989.

5. Web resources :

� www.DSPguide.com- 24 units covering the syllabus.

� rleweb.mit.edu/Publications/pr141/ acrobat/Rep141-iii.2.1.pdf

� www.pentek.com/products/GetLit.CFM/ wp021802.pdf?Filename=wp021802.pdf -

� www.dspfactory.com/pdf/Embedded_DSP.pdf

� www.ecs.umass.edu/ece/tessier/jvsp00.pdf

� www.analog.com/UploadedFiles/Application_Notes/ 617780679AN334.pdf -

� www.caip.rutgers.edu/~rabinkin/Multirate.pdf

6. Lesson Plan

Sl.No Topics Book Periods Cumulative

Hours

UNIT –I REPRESENTATION OF SIGNALS

1. Continuous - discrete time signals R1&R2 2 2

Page 3: DSP Courseplan

2. classification of signals 3 5

3. discrete time signals and systems 1 6

4. Properties-Discrete time signals 3 9

5. analog to digital converter 1 10

6. digital to analog convertor 1 11

UNIT - II

DISCRETE TIME SIGNALS

7. Computation of impulse response

R1&R2

2 13

8. transfer function using z transform - z-

transform definition – region of

convergence – properties of roc -

properties of z-transform -

1 14

9. inverse z-transform 1 15

10. convolution – linear convolution –circular

convolution

1 16

11. overlap add method - over lap save

method

1 17

UNIT- III

DFT & FFT

12. DFT - DTFT Properties -

R2&R4

1 18

13. Introduction to Radix 2 FFT’s –

decimation in time FFT algorithm

decimation in frequency FFT algorithm

6 24

14. computing inverse DFT using FFT 2 26

UNITY - IV

IIR & FIR

15. Classification – reliability constrains – IIR

design – bilinear transform method –

R2&R3

4 30

16. IIR-impulse invariant method 4 34

17. FIR design – Fourier series method –

window function method

2 36

UNIT - V

DIGITAL SIGNAL PROCESSORS

18. Introduction to DSP architecture –

Harvard architecture -

R2

2 38

19. Dedicated MAC unit - Multiple ALUs, 4 42

20. Advanced addressing modes, Pipelining, 4 46

21. Overview of instruction set of

TMS320C5X and C54X. (Simulations of

Digital signals, DFT, FFT, filters in

matlab)

5 51

22. Application- Audio processing – Image

processing

3 54

7. Portion for Sessional Exam:

Sl.No Sessional

Exam

Topics

1 I 1-10

2 II 11-17

Page 4: DSP Courseplan

8. Assignment:

S.No Assignment Topic

1 I Systems-40 Problems-Enclosure-1

2 II Convolution – 10 Problems-

Enclosure-2

3 III DFT-5 Problems-Enclosure-3

4 IV FFT-5 Problems-Enclosure-4

5 V Filters-FIR-2 Problems

IIR – 3 Problems-Enclosure-5

6 VI Digital Signal Processors-

Enclosure-6

9. Seminar Topics: � Architecture of DSP processors.

� Applications of DSP processors-TMS320C50, ADSP 2181.

10. Additional topics: � Introduction to Embedded systems.

� Architecture of Embedded systems.

� Programming of Embedded systems.

� Real time applications on embedded systems.

11. Related books & Magazines: IEEE transaction on signal processing.

12. Related Experiments:

� Basic programs in MATLAB- signal generations.

� Programming of DSP TMS320C50 processors.

13. Tutorials:

PART-A

UNIT-1

1. What is meant by discrete time signals?

2. What are the methods used to represent the discrete time signals?

3. Define Z transform?

4. What is meant by continuous time signals?

5. Define System

6. Sketch the block diagram of DSP system

7. What are the advantages and dis advantages of DSP?

8. Give some application of DSP?

9. Define impulse & unit step signals

10. List the mathematical operations performed on discrete time signals?

11. perform addition of discrete time signals

X1(n)={2,2,1,1} X2(n)={-2,-1,3,2}

12. Classify the system with examples

13. define signals & describe the classification of signals

Page 5: DSP Courseplan

UNIT II

14. Define Z transform

15. Define convolution& mention its properties

16. What are the methods used to perform inverse Z transform?

17. Define DFS?

18. List properties of DFS.

19. Define DFT?

20. List the properties of DFT.

21. What are the drawback in Fourier transform & how it is overcome?

22. What is the relation between DTFT &DFT?

23. Give two application of DFT OR Mention the importance of DFT.

24. What is the relation between Z transform & DFT?

25. In Y(n)=X(n)*h(n) how will you determine the start and end of Y(n)?What will be length

of Y(n)?

26. What is sectioned convolution?

27. Why sectioned convolution is performed?

28. What are the two methods of sectioned convolution?

29. Compare overlap & overlap save method?

30. How is Z transform obtained from Laplace transform & z transform?

31. Describe the relationship between Laplace transform & Z transform?

32. State & explain the properties of Z transform?

33. Define DFT & explain the properties of DFT?

UNIT III

34. What is FFT? Why FFT is needed?

35. What is radix 2 FFT?

36. How many multiplications additions are involved in Radix 2 FFT?

37. Calculate the percentage saving in calculations in a 512 pt radix -2 FFT when compared

to direct DFT?

38. What is DIT radix -2 FFT?

39. What is DIF radix -2 FFT?

40. Arrange the 8 pt sequence X(n)=1,2,3,4,-1,-2,-3,-4} in bit reversed order?

41. Draw the basic butterfly diagram of DIT radix -2 FFT?

42. Draw the basic butterfly diagram of DIF radix -2 FFT?

43. Compare DIT radix -2 FFT & DIF radix-2 FFT?

44. What is phase factor or twiddle factor?

UNIT IV

45. How LTI systems behave as a frequency selective filters?

46. What are FIR filters?

47. What are the advantages & disadvantages FIR filters?

48. Write the steps involved in FIR filter design?

49. List the well known design techniques for linear phase FIR filter?

50. What is Gibb’s phenomenon?

51. Write the procedure for FIR filter design by

a. Fourier series method

b.Frequency sampling

c.Window method

52. What are the necessary & sufficient conditions for linear phase characteristics of FIR

filter?

53. Define IIR filter & list important features of IIR filter

54. Distinguish IIR & FIR filter

Page 6: DSP Courseplan

55. Classify the filter based on frequency response?

56. What are the requirements for an analog filter to be stable and causal?

57. What are the requirements for an digital filter to be stable and causal?

58. Write a brief note on design of IIR filter.

59. Compare digital & analog filter.

60. What are the advantages & disadvantages of digital filters.

61. What is impulse invariant transformation? Mention its advantages & disadvantages of it?

62. What is bilinear transformation? Mention its Advantages & disadvantages of it?

63. What is pre warping? Why it is employed?

UNIT V

64. What is meant by haward architecture?

65. What are the advantages of parallel processing?

66. What are the advantages of DSP over microprocessors?

67. List the generations of DSP Processors?

68. Define floating point & fixed point processor.

69. Explain the instruction MACD?

70. What is the purpose of auxiliary register?

71. Explain the instruction ZAP?

72. Mention the application of TMS320C50 processor?

73. Explain the instruction IN & OUT?

74. Mention the application of ADSP 2181 processor?

75. Explain the instruction SPLK?

PART B

1) Consider the analog Signal X(t)=3 COS (100п t)

i) Determine the minimum sampling rate required to avoid Aliasing

ii) What is the signal obtained if the sampling is 200 Hz

iii) What is the signal obtained after f= 75 Hz

2) Determine whether the system described by the following equations are liner time

invariant

i)Y(n)=nX(n)

ii)Y(n)=aX(n)+b

3)Find the output of the given system by use of convolution

i)X(n)={1,2,1,3,2}

ii)h(n) ={1,1,2,1,3}

4)Find out the convolution by using the Z transform

i)h(n)={1,1,2,3}

ii)X(n)={2,5,6,8}

5)Determine the impulse response of the system described by the difference equation

Y(k)=Y(n-k)+X(k)

6) Solve the following Difference Equation by Z transform

X(k+2)+3X(k+1)+2X(k)=0 X(0)=0:X(1)=1

7) Define z transform and its properties with proof.

Page 7: DSP Courseplan

8) Explain the properties of the system?

9) Explain the advantages and disadvantages of DSP over ASP

10) Find Z transform Of δ(n)-0.95δ(n-6)

11) State and explain the properties of DFT

12) The five samples of the 9 point DFT are given as follows

i)4 point DFT of X(n)={ 1, 2,2,1}

ii)x(n)= { 1,2,2,1}

iii)x(n)={1,2,3}

13)Compute the 5 point of x(n)={0,1,2,3,4} .

14) Compute the 8 point of x(n)={ 1 , 0 ≤ n ≤ 3

0, 4 ≤ n ≤ 7

15) Compute 8 pt DFT of X(n)by radix-2 DIT FFT.

X(n)={1,3,2,2,2,1,3,2}

16) Compute 8 pt DFT of X(n)by radix-2 DIT FFT.

X(n)={1,2,3,4,4,3,2,1 }

17) Compute 8 pt DFT of X(n)by radix-2 DIT FFT.

X(n)={1,3,2,2,7,3,9,5 }

18) Compute 8 pt DFT of X(n)by radix-2 DIT FFT.

X(n)={1,3,5,6,2,1,3,2 }

19) Compute 8 pt DFT of X(n)by radix-2 DIT FFT.

X(n)={1,0,1,1,0,1,1,1}

20) Compute 8 pt DFT of X(n)by radix-2 DIT FFT.

X(n)={1,1,1,1,0,1,1,1}

21) Compute 8 pt DFT of X(n)by radix-2 DIF FFT.

X(n)={1,0,1,1,0,1,1,1}

22) Determine 8 pt DFT of the signal

X(n)={1,1,1,1,1,1,0,0}

23) An 8 point sequence is given by X(n)={2,2,2,2,1,1,1,1}.Compute 8pt DFT of x(n) by

Radix-2 DIF-FFT.

24) An 8 point sequence is given by X(n)={2,2,2,2,1,1,1,1}.Compute * pt DFT of x(n) by

Radix-2 DIF-FFT.

25) Convert the following analog filter in to digital filter by using Backward Difference

method

i) H(s) =1/s+2

ii) H(s) =1/s2+6

Page 8: DSP Courseplan

26) Convert the analog filter in to digital filter by using impulse

invariant method

S+0.2

i) H(s) =

(S+0.2)2+9

1

ii) H(s) = (S+1) (S+2)

27) Convert the analog filter in to digital filter by using bilinear transformation method.

28) Design a LPF using rectangular window by taking a sample of

W (n) & with Fc=1.2 rad/sec

29)Design a HPF using Hamming window by taking samples of W(n)

with Fc=1.2 rad/sec

30)Design a BPF to pass frequencies in the range 1 to2 rad/sec using

hamming window with N=5

Prepared By: Dr.M.Pallikonda Rajasekaran/ Professor / ECE