Ee 411 T Digital Signal Processing and Applications

Ee 411 T Digital Signal Processing and Applications

<p> EEU 302 DIGITAL SIGNAL PROCESSING & APPLICATIONS</p><p>S6 Core L T P C 3 1 0 3 Objective and level of course: 1) To understand the basic class of discrete-time signals and systems and their representations. 2) To understand the use of transforms for the analysis of discrete- time systems. 3) To understand the digital filter design techniques and finite word length effects. 4) To understand DFT and algorithms for its computations. 5) To identify applications with analysis </p><p>Prerequisite: Nil</p><p>Module I (10+2 hours) Discrete-time signals and systems: Discrete-time signals - sequences - Discrete-time systems- linear shift - invariant systems - stability and causality - difference equations - frequency domain representations – Review of Fourier transform and its properties - sampling of continuous – Spectral characteristics - time signals - z transform - inverse z transforms .</p><p>Module II (10 +3 hours) Transform Analysis of LTI Systems and Structures for DTS: Frequency response for rational system functions- Geometric construction for computation of the frequency response function from pole-zero plots- minimum phase systems-Linear systems with generalized linear phase- basic structures for IIR and FIR systems- Direct forms- cascade forms- parallel forms-Lattice structures- DSP chips - architecture of fixed point and floating point DSP core (schematics only) – implementation.</p><p>Module III (12+4 hours) Digital filter design techniques and finite wordlength effects: Design of IIR filters from analog filters - analog Butterworth function for various filters- analog to digital transformation - backward - difference and forward - difference approximations - impulse invariant transformation - bilinear transformation - prewarping - - design examples - properties of FIR filters - design of FIR filters using windows - comparison of IIR and FIR filters - finite word length effect in DSP- zero-input limit cycles in fixed point realizations of IIR digital filters-Limit cycles due to overflow. Applications for Speech signal processing.</p><p>Module IV (10+3 hours) The Discrete Fourier Transform :Representation of periodic sequences - properties of discrete Fourier series - discrete Fourier transforms - properties of DFT - linear convolution using DFT - overlap - add method - overlap - save method - FFT - Radix2 DIT FFT algorithm - Radix2 DIF FFT algorithm - butterfly structure - bit reversed order - in - place computations-Fourier analysis of signals using the DFT- DFT Application and analysis.</p><p>Reference Books</p><p>1. Alan V . Oppenheim, Ronald W. Schafer, .Discrete-Time Signal Processing., Prentice-Hall of India Pvt. Ltd., New Delhi, 1997 2. Sanjit K Mitra, .Digital Signal Processing: A computer-based approach. ,Tata Mc Grow-Hill edition .1998 3. John G. Proakis, and Dimitris G. Manolakis, .Digital Signal Processing.(third edition), Prentice-Hall of India Pvt. Ltd, New Delhi, 1997 4. Emmanuel C. Ifeachor, Barrie W. Jervis , .Digital Signal Processing-A practical Approach., Addison . Wesley,1993 5. Abraham Peled and Bede Liu, .Digital Signal Processing., John Wiley and Sons, 1976 6. Haykin and Van Veen, Signals and Systems, (second edition), John Wiley and sons, Inc.,2003. </p>

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    2 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us