ELEG 305: Digital Signal Processing
|
|
- Benedict Bridges
- 5 years ago
- Views:
Transcription
1 ELEG 305: Digital Signal Processing Lecture 18: Applications of FFT Algorithms & Linear Filtering DFT Computation; Implementation of Discrete Time Systems Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 2008 K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20 Outline 1 Review of Previous Lecture 2 Lecture Objectives 3 Applications of FFT Algorithms Efficient Computation of the DFT of Two Real Sequences Efficient Computation of the DFT of 2N Point Real Sequences A Linear Filtering Approach to Computation of the DFT 4 Implementation of Discrete-Time Systems Structures for the Realization of Discrete Time Systems Structures for FIR systems Direct Form Structures for FIR systems Cascade Form Structures for FIR systems Lattice Structures for FIR systems K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20
2 Review of Previous Lecture Review of Previous Lecture FFT and IFFT calculation complexity O(N log 2 N); radix 2, radix 4, and split radix methods Radix 2 Decimation in Freq. (FFT) algorithm Decompose signal log 2 N times; Basic computation is the butterfly Radix 4 Decimation in Time (FFT) algorithm Decompose signal log 4 N times; Basic computation is the butterfly FFT Based Filtering Compute N point FFT of h(n) and x(n), N M + L 1 (and a power of 2); multiply H(k)X(k); complete IFFT to get h(n) x(n); process long signals block wise x(n) x(n+n/2) -1 WN n g1(n) g2(n) K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20 Lecture Objectives Lecture Objectives Objective Derive methods for efficiently computing the FFT of real valued sequences; Derive a linear filtering approach to computing the DFT; Derive implementations of FIR discrete time systems Reading Chapters 8 ( ) and 9 ( ); Next lecture, Lattice Filters (Chapter 9.2) K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20
3 Applications of FFT Algorithms Efficient Computation of the DFT of Two Real Sequences Observation: The DFT operates on complex valued inputs Objective: Efficiently compute the DFT of two real valued sequences For x 1 (n) and x 2 (n) length N real sequences, set x(n) = x 1 (n) + jx 2 (n) n = 0, 1,..., N 1 X(k) = X 1 (k) + jx 2 (k) j = 0, 1,..., N 1 Exploiting the x (n) DFT N X (N k) property yields x 1 (n) = REAL{x(n)} = 1 2 [x(n) + x (n)] X 1 (k) = 1 2 [X(k) + X (N k)] x 2 (n) = IMAG{x(n)} = 1 2j [x(n) x (n)] X 2 (k) = 1 2j [X(k) X (N k)] Result: When computing X 1 (k), we can get X 2 (k) for free K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20 Applications of FFT Algorithms Efficient Computation of the DFT of 2N Point Real Sequences Objective: Efficiently compute the DFT of a 2N point real sequence Suppose g(n) is real and has length 2N. Define x 1 (n) = g(2n) x 2 (n) = g(2n + 1) Observation: These are two N point real valued sequences. Thus set x(n) = x 1 (n) + jx 2 (n) n = 0, 1,..., N 1 Previous result shows that X 1 (k) = 1 2 [X(k) + X (N k)] X 2 (k) = 1 2j [X(k) X (N k)] Challenge: Express the 2N point DFT of g(n) (i.e., G(k)) in terms of the N point DFTs X 1 (k) and X 2 (k) K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20
4 By definition, G(k) = Applications of FFT Algorithms = = or more compactly 2N 1 n=0 N 1 g(n)w kn 2N n=0 N 1 g(2n)w2n 2nk n=0 Efficient Computation of the DFT of 2N Point Real Sequences N 1 + n=0 N 1 x 1 (n)wn nk + W 2N k n=0 g(2n + 1)W (2n+1)k 2N x 2 (n)w nk N G(k) = X 1 (k) + W k 2N X 2(k), k = 0, 1,..., N 1 G(k + N) = X 1 (k) W k 2N X 2(k), k = 0, 1,..., N 1 where the second result follows from periodicity, i.e., X i (k + N) = X i (k) and W k+n 2N = W2N k Result: The DFT computational cost for a 2N length real sequence is approximately equal to that for a N length complex sequence K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20 Applications of FFT Algorithms A Linear Filtering Approach to Computation of the DFT Objective: Utilized linear filtering to computer the DFT Note: This is efficient when only a few terms are required (< log 2 N) X(k) = Define y k (n) = N 1 x(m)wn km m=0 N 1 = W kn N x(m)wn km m=0 [multiply by W kn N = 1] N 1 = x(m)w k(n m) N m=0 } {{ } convolution N 1 x(m)w k(n m) N = x(n) h k (n) ( ) m=0 where h k (n) = W kn N u(n) Note: Comparing ( ) and ( ) shows equivalence at n = N, i.e., X(k) = y k (n) n=n Interpretation: X(k) is the output of filter h k (n) at time n = N K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20 ( )
5 Applications of FFT Algorithms A Linear Filtering Approach to Computation of the DFT Evaluate h k (n) = W kn N u(n) by taking the z transform H k (z) = h k (n)z n = W kn N z n n= n=0 1 = 1 W k N z 1 Observations: Approach known as the Goertzel Algorithm (1958) This filter has a pole on the unit circle at frequency ω k = 2πk/N This is the sampled frequency of X(k), i.e. X(k) = X(ω k ) where ω k = 2πk/N From H k (z) we get a difference equation realization y k (n) = W k N y k(n 1) + x(n) Select DFT terms obtained by a bank of H k (z) filters Filter outputs give DFT coefficients for the prior N input samples Filters require complex multiplications & additions K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20 Implementation of Discrete-Time Systems Structures for the Realization of Discrete Time Systems Discrete Time Systems Realization Structures Objective: Design system realizations that consider: Computational complexity Memory requirements Finite-word-length effects Different realizations have different advantages/disadvantages General systems considered: N M y(n) = a k y(n k) + b k x(n k) or equivalently M b k z k H(z) = N 1 + a k z k K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20
6 Implementation of Discrete-Time Systems Structures for FIR systems Structures for FIR systems Objective: Consider structures for the FIR case y(n) = H(z) = M 1 b k x(n k) M 1 b k z k Note: FIR filter coefficients {b k } equal the impulse response, i.e., { bn 0 n M 1 h(n) = 0 otherwise where y(n) = x(n) h(n) = M 1 h(k)x(n k) K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20 Implementation of Discrete-Time Systems Direct Form Structures for FIR systems M 1 Direct realization of y(n) = h(k)x(n k) yields FIR filter direct form realization; tapped delay line or transversal system Observations: M multiplications; M 1 additions & memory locations A FIR filter is linear phase iff (more info. in Ch. 10) h(n) = ±h(m 1 n) In this case, we can reduce the number of multiplies to M/2 K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20
7 Implementation of Discrete-Time Systems Direct Form Structures for FIR systems For instance, suppose h(n) = h(m 1 n). Then y(n) = = M 1 h(k)x(n k) M/2 1 h(k)[x(n k) + x(n (M 1 k))] which yields a linear phase FIR filter direct realization (N odd shown) K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20 Implementation of Discrete-Time Systems Cascade Form Structures for FIR systems Objective: Factor H(z) to yield a cascade implementation To form a cascade of second order FIR filters, let K H(z) = H k (z) where H k (z) = b k0 + b k1 z 1 + b k2 z 2, k = 1, 2,..., K Note: To ensure coefficients are real, group complex conjugate roots, i.e., Realization of Each Stage H k (z) = (1 z k z 1 )(1 zk z 1 ) = b k0 + b k1 z 1 + b k2 z 2 K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20
8 Implementation of Discrete-Time Systems Cascade Form Structures for FIR systems Note: If H(z) is linear phase, additional symmetries hold h(n) = ±h(m 1 n) symmetry H(z) zeroes in reciprocal pairs, i.e, z k, z k zeros = 1/z k, 1/z k zeros Simplification is achieved by utilizing fourth order stages H k (z) = c k0 (1 z k z 1 )(1 zk z 1 )(1 z 1 /z k )(1 z 1 /zk ) = c k0 + c k1 z 1 + c k2 z 2 + c k1 z 3 + c k0 z 4 Observation: Exploiting the linear phase induced symmetries halves the computational costs Approach: Cascade fourth (or second) order stages K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20 Implementation of Discrete-Time Systems Lattice Structures for FIR systems Objective: Developed a lattice structure realization of FIR filters Approach: Suppose we have a sequence of FIR filters H m (z) = A m (z) m = 0, 1,..., M 1 where by definition m A m (z) = 1 + α m (k)z k m 1 Example A 0 (z) = 1 A 1 (z) = 1 + α 1 (1)z 1 A 2 (z) = 1 + α 2 (1)z 1 + α 2 (2)z 2 A 3 (z) = 1 + α 3 (1)z 1 + α 3 (2)z 2 + α 3 (3)z 3... K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20
9 Implementation of Discrete-Time Systems Lattice Structures for FIR systems The m th filter, H m (z) = A m (z) = 1 + m α m(z), output is m m y(n) = x(n) + α m (k)x(n k) = x(n) [ α m (k)x(n k)] = x(n) ˆx(n) where ˆx(n) = m [ α m(k)x(n k)] Observations: ˆx(n) can be thought of as a prediction of x(n) x(n) ˆx(n) it is the prediction error Direct Form Tap Delay Realization Prediction Error Formulation (Direct Form) Realization K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20 Implementation of Discrete-Time Systems Lattice Structures for FIR systems Suppose m = 1, then y(n) = x(n) + α 1 (1)x(n 1) ( ) To build a cascade of 1 st order stages, generalize the notation. Let f 0 (n) = x(n) g 0 (n) = x(n) f 1 (n) = f 0 (n) + K 1 g 0 (n 1) g 1 (n) = K 1 f 0 (n) + g 0 (n 1) Question: For what value of K 1 is ( ) realized? Single Stage Lattice Filter K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20
10 Implementation of Discrete-Time Systems Lattice Structures for FIR systems Let K 1 = α 1 (1). Then Similarly, Single Stage Lattice Filter f 1 (n) = f 0 (n) + K 1 g 0 (n 1) = x(n) + α 1 (1)x(n 1) = y(n) [order m = 1 filter output] g 1 (n) = α 1 (1)x(n) + x(n 1) Note: K 1 is referred to as a reflection coefficient Objective: Form cascades of multiple stages to realize more complex filtering operations K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20 Lecture Summary Lecture Summary Efficient FFT computation for real sequences For x 1 (n) and x 2 (n) real, set x(n) = x 1 (n) + jx 2 (n) then X 1 (k) = 1 2 [X(k) + X (N k)]; X 2 (k) = 1 2j [X(k) X (N k)] Similar tricks hold for length 2N real sequences Linear filtering computation of the DFT the Goertzel algorithm y k (n) = W k N y k(n 1) + x(n) gives X(k) = y k (n) n=n Implementations of FIR discrete time systems Direct, Cascade, and Lattice filter structures Next lecture Lattice Filters (Chapter 9.2) K. E. Barner (Univ. of Delaware) ELEG 305: Digital Signal Processing Fall / 20
ELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture 19: Lattice Filters Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 2008 K. E. Barner (Univ. of Delaware) ELEG
More informationELEG 305: Digital Signal Processing
ELEG 5: Digital Signal Processing Lecture 6: The Fast Fourier Transform; Radix Decimatation in Time Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 8 K.
More information! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular
Previously ESE 531: Digital Signal Processing Lec 22: April 18, 2017 Fast Fourier Transform (con t)! Circular Convolution " Linear convolution with circular convolution! Discrete Fourier Transform " Linear
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture 1: Course Overview; Discrete-Time Signals & Systems Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 2008 K. E.
More informationDigital Signal Processing Lecture 4
Remote Sensing Laboratory Dept. of Information Engineering and Computer Science University of Trento Via Sommarive, 14, I-38123 Povo, Trento, Italy Digital Signal Processing Lecture 4 Begüm Demir E-mail:
More informationSIDDHARTH GROUP OF INSTITUTIONS:: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)
SIDDHARTH GROUP OF INSTITUTIONS:: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code : Digital Signal Processing(16EC422) Year & Sem: III-B.Tech & II-Sem Course
More informationDSP Algorithm Original PowerPoint slides prepared by S. K. Mitra
Chapter 11 DSP Algorithm Implementations 清大電機系林嘉文 cwlin@ee.nthu.edu.tw Original PowerPoint slides prepared by S. K. Mitra 03-5731152 11-1 Matrix Representation of Digital Consider Filter Structures This
More informationDigital Signal Processing. Midterm 2 Solutions
EE 123 University of California, Berkeley Anant Sahai arch 15, 2007 Digital Signal Processing Instructions idterm 2 Solutions Total time allowed for the exam is 80 minutes Please write your name and SID
More informationFall 2011, EE123 Digital Signal Processing
Lecture 6 Miki Lustig, UCB September 11, 2012 Miki Lustig, UCB DFT and Sampling the DTFT X (e jω ) = e j4ω sin2 (5ω/2) sin 2 (ω/2) 5 x[n] 25 X(e jω ) 4 20 3 15 2 1 0 10 5 1 0 5 10 15 n 0 0 2 4 6 ω 5 reconstructed
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture 4: Inverse z Transforms & z Domain Analysis Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 008 K. E. Barner
More information/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by
Code No: RR320402 Set No. 1 III B.Tech II Semester Regular Examinations, Apr/May 2006 DIGITAL SIGNAL PROCESSING ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering,
More information2. Typical Discrete-Time Systems All-Pass Systems (5.5) 2.2. Minimum-Phase Systems (5.6) 2.3. Generalized Linear-Phase Systems (5.
. Typical Discrete-Time Systems.1. All-Pass Systems (5.5).. Minimum-Phase Systems (5.6).3. Generalized Linear-Phase Systems (5.7) .1. All-Pass Systems An all-pass system is defined as a system which has
More informationEE482: Digital Signal Processing Applications
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:305:45 CBC C222 Lecture 8 Frequency Analysis 14/02/18 http://www.ee.unlv.edu/~b1morris/ee482/
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture : Design of Digital IIR Filters (Part I) Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 008 K. E. Barner (Univ.
More informationDHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A
DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A Classification of systems : Continuous and Discrete
More informationDiscrete-time signals and systems
Discrete-time signals and systems 1 DISCRETE-TIME DYNAMICAL SYSTEMS x(t) G y(t) Linear system: Output y(n) is a linear function of the inputs sequence: y(n) = k= h(k)x(n k) h(k): impulse response of the
More informationECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION
FINAL EXAMINATION 9:00 am 12:00 pm, December 20, 2010 Duration: 180 minutes Examiner: Prof. M. Vu Assoc. Examiner: Prof. B. Champagne There are 6 questions for a total of 120 points. This is a closed book
More informationDigital Signal Processing
DIGITAL SIGNAL PROCESSING SUBJECT CODE : NO. OF LECTURE HRS/WEEK : 04 TOTAL NO. OF LECTURE HRS. : 52 IA MARKS : 25 EXAM HOURS : 03 EXAMMARKS : 100 UNIT - 1 DISCRETE FOURIER TRANSFORMS (DFT): FREQUENCY
More informationLecture 19 IIR Filters
Lecture 19 IIR Filters Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/5/10 1 General IIR Difference Equation IIR system: infinite-impulse response system The most general class
More informationINF3440/INF4440. Design of digital filters
Last week lecture Today s lecture: Chapter 8.1-8.3, 8.4.2, 8.5.3 INF3440/INF4440. Design of digital filters October 2004 Last week lecture Today s lecture: Chapter 8.1-8.3, 8.4.2, 8.5.3 Last lectures:
More informationLECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)
LECTURE NOTES ON DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13) FACULTY : B.V.S.RENUKA DEVI (Asst.Prof) / Dr. K. SRINIVASA RAO (Assoc. Prof) DEPARTMENT OF ELECTRONICS AND COMMUNICATIONS
More informationMAHALAKSHMI ENGINEERING COLLEGE-TRICHY
DIGITAL SIGNAL PROCESSING DEPT./SEM.: ECE&EEE /V DISCRETE FOURIER TRANFORM AND FFT PART-A 1. Define DFT of a discrete time sequence? AUC MAY 06 The DFT is used to convert a finite discrete time sequence
More informationDEPARTMENT OF EI DIGITAL SIGNAL PROCESSING ASSIGNMENT 1
This PDF is Created by Simpo PDF Creator unregistered version - http://wwwsimpopdfcom Study hard, for the well is deep, and our brains are shallow DEPARTMENT OF EI DIGITAL SIGNAL PROCESSING ASSIGNMENT
More informationEE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley
University of California Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences Professors : N.Morgan / B.Gold EE225D Digital Filters Spring,1999 Lecture 7 N.MORGAN
More informationEE123 Digital Signal Processing
Announcements EE Digital Signal Processing otes posted HW due Friday SDR give away Today! Read Ch 9 $$$ give me your names Lecture based on slides by JM Kahn M Lustig, EECS UC Berkeley M Lustig, EECS UC
More informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Solutions for Problem Set 2
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science Issued: Tuesday, September 5. 6.: Discrete-Time Signal Processing Fall 5 Solutions for Problem Set Problem.
More informationImplementation of Discrete-Time Systems
EEE443 Digital Signal Processing Implementation of Discrete-Time Systems Dr. Shahrel A. Suandi PPKEE, Engineering Campus, USM Introduction A linear-time invariant system (LTI) is described by linear constant
More informationEDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT. October 19, 2016
EDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT October 19, 2016 DFT resolution 1 N-point DFT frequency sampled at θ k = 2πk N, so the resolution is f s/n If we want more, we use N
More information1. Calculation of the DFT
ELE E4810: Digital Signal Processing Topic 10: The Fast Fourier Transform 1. Calculation of the DFT. The Fast Fourier Transform algorithm 3. Short-Time Fourier Transform 1 1. Calculation of the DFT! Filter
More informationDefinition. A signal is a sequence of numbers. sequence is also referred to as being in l 1 (Z), or just in l 1. A sequence {x(n)} satisfying
Signals and Systems. Definition. A signal is a sequence of numbers {x(n)} n Z satisfying n Z x(n)
More informationE : Lecture 1 Introduction
E85.2607: Lecture 1 Introduction 1 Administrivia 2 DSP review 3 Fun with Matlab E85.2607: Lecture 1 Introduction 2010-01-21 1 / 24 Course overview Advanced Digital Signal Theory Design, analysis, and implementation
More informationVU Signal and Image Processing. Torsten Möller + Hrvoje Bogunović + Raphael Sahann
052600 VU Signal and Image Processing Torsten Möller + Hrvoje Bogunović + Raphael Sahann torsten.moeller@univie.ac.at hrvoje.bogunovic@meduniwien.ac.at raphael.sahann@univie.ac.at vda.cs.univie.ac.at/teaching/sip/17s/
More informationECE503: Digital Signal Processing Lecture 6
ECE503: Digital Signal Processing Lecture 6 D. Richard Brown III WPI 20-February-2012 WPI D. Richard Brown III 20-February-2012 1 / 28 Lecture 6 Topics 1. Filter structures overview 2. FIR filter structures
More informationLecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.
Lecture 10 Digital Signal Processing Chapter 7 Discrete Fourier transform DFT Mikael Swartling Nedelko Grbic Bengt Mandersson rev. 016 Department of Electrical and Information Technology Lund University
More informationDigital Signal Processing Lecture 3 - Discrete-Time Systems
Digital Signal Processing - Discrete-Time Systems Electrical Engineering and Computer Science University of Tennessee, Knoxville August 25, 2015 Overview 1 2 3 4 5 6 7 8 Introduction Three components of
More information( ) John A. Quinn Lecture. ESE 531: Digital Signal Processing. Lecture Outline. Frequency Response of LTI System. Example: Zero on Real Axis
John A. Quinn Lecture ESE 531: Digital Signal Processing Lec 15: March 21, 2017 Review, Generalized Linear Phase Systems Penn ESE 531 Spring 2017 Khanna Lecture Outline!!! 2 Frequency Response of LTI System
More informationENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin
ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM Dr. Lim Chee Chin Outline Introduction Discrete Fourier Series Properties of Discrete Fourier Series Time domain aliasing due to frequency
More informationVALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF INFORMATION TECHNOLOGY. Academic Year
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur- 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY Academic Year 2016-2017 QUESTION BANK-ODD SEMESTER NAME OF THE SUBJECT SUBJECT CODE SEMESTER YEAR
More informationThe Fourier transform allows an arbitrary function to be represented in terms of simple sinusoids. The Fourier transform (FT) of a function f(t) is
1 Introduction Here is something I wrote many years ago while working on the design of anemometers for measuring shear stresses. Part of this work required modelling and compensating for the transfer function
More informationModule 3. Convolution. Aim
Module Convolution Digital Signal Processing. Slide 4. Aim How to perform convolution in real-time systems efficiently? Is convolution in time domain equivalent to multiplication of the transformed sequence?
More informationLecture 7 Discrete Systems
Lecture 7 Discrete Systems EE 52: Instrumentation and Measurements Lecture Notes Update on November, 29 Aly El-Osery, Electrical Engineering Dept., New Mexico Tech 7. Contents The z-transform 2 Linear
More informationDigital Signal Processing
COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #21 Friday, October 24, 2003 Types of causal FIR (generalized) linear-phase filters: Type I: Symmetric impulse response: with order M an even
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 22: April 10, 2018 Adaptive Filters Penn ESE 531 Spring 2018 Khanna Lecture Outline! Circular convolution as linear convolution with aliasing! Adaptive Filters Penn
More informationHow to manipulate Frequencies in Discrete-time Domain? Two Main Approaches
How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches Difference Equations (an LTI system) x[n]: input, y[n]: output That is, building a system that maes use of the current and previous
More informationDISCRETE FOURIER TRANSFORM
DISCRETE FOURIER TRANSFORM 1. Introduction The sampled discrete-time fourier transform (DTFT) of a finite length, discrete-time signal is known as the discrete Fourier transform (DFT). The DFT contains
More informationDigital Signal Processing Lecture 9 - Design of Digital Filters - FIR
Digital Signal Processing - Design of Digital Filters - FIR Electrical Engineering and Computer Science University of Tennessee, Knoxville November 3, 2015 Overview 1 2 3 4 Roadmap Introduction Discrete-time
More informationLet H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )
Review: Poles and Zeros of Fractional Form Let H() = P()/Q() be the system function of a rational form. Let us represent both P() and Q() as polynomials of (not - ) Then Poles: the roots of Q()=0 Zeros:
More informationLecture 18: Stability
Lecture 18: Stability ECE 401: Signal and Image Analysis University of Illinois 4/18/2017 1 Stability 2 Impulse Response 3 Z Transform Outline 1 Stability 2 Impulse Response 3 Z Transform BIBO Stability
More informationEE 521: Instrumentation and Measurements
Aly El-Osery Electrical Engineering Department, New Mexico Tech Socorro, New Mexico, USA November 1, 2009 1 / 27 1 The z-transform 2 Linear Time-Invariant System 3 Filter Design IIR Filters FIR Filters
More informationDigital Signal Processing. Lecture Notes and Exam Questions DRAFT
Digital Signal Processing Lecture Notes and Exam Questions Convolution Sum January 31, 2006 Convolution Sum of Two Finite Sequences Consider convolution of h(n) and g(n) (M>N); y(n) = h(n), n =0... M 1
More information7.17. Determine the z-transform and ROC for the following time signals: Sketch the ROC, poles, and zeros in the z-plane. X(z) = x[n]z n.
Solutions to Additional Problems 7.7. Determine the -transform and ROC for the following time signals: Sketch the ROC, poles, and eros in the -plane. (a) x[n] δ[n k], k > 0 X() x[n] n n k, 0 Im k multiple
More informationFrequency-domain representation of discrete-time signals
4 Frequency-domain representation of discrete-time signals So far we have been looing at signals as a function of time or an index in time. Just lie continuous-time signals, we can view a time signal as
More information# FIR. [ ] = b k. # [ ]x[ n " k] [ ] = h k. x[ n] = Ae j" e j# ˆ n Complex exponential input. [ ]Ae j" e j ˆ. ˆ )Ae j# e j ˆ. y n. y n.
[ ] = h k M [ ] = b k x[ n " k] FIR k= M [ ]x[ n " k] convolution k= x[ n] = Ae j" e j ˆ n Complex exponential input [ ] = h k M % k= [ ]Ae j" e j ˆ % M = ' h[ k]e " j ˆ & k= k = H (" ˆ )Ae j e j ˆ ( )
More informationEEL3135: Homework #4
EEL335: Homework #4 Problem : For each of the systems below, determine whether or not the system is () linear, () time-invariant, and (3) causal: (a) (b) (c) xn [ ] cos( 04πn) (d) xn [ ] xn [ ] xn [ 5]
More informationDiscrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz
Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W.
More informationVery useful for designing and analyzing signal processing systems
z-transform z-transform The z-transform generalizes the Discrete-Time Fourier Transform (DTFT) for analyzing infinite-length signals and systems Very useful for designing and analyzing signal processing
More informationDiscrete Fourier Transform
Discrete Fourier Transform Virtually all practical signals have finite length (e.g., sensor data, audio records, digital images, stock values, etc). Rather than considering such signals to be zero-padded
More informationTransforms and Orthogonal Bases
Orthogonal Bases Transforms and Orthogonal Bases We now turn back to linear algebra to understand transforms, which map signals between different domains Recall that signals can be interpreted as vectors
More informationDSP Configurations. responded with: thus the system function for this filter would be
DSP Configurations In this lecture we discuss the different physical (or software) configurations that can be used to actually realize or implement DSP functions. Recall that the general form of a DSP
More informationDFT & Fast Fourier Transform PART-A. 7. Calculate the number of multiplications needed in the calculation of DFT and FFT with 64 point sequence.
SHRI ANGALAMMAN COLLEGE OF ENGINEERING & TECHNOLOGY (An ISO 9001:2008 Certified Institution) SIRUGANOOR,TRICHY-621105. DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING UNIT I DFT & Fast Fourier
More informationLecture 11 FIR Filters
Lecture 11 FIR Filters Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/4/12 1 The Unit Impulse Sequence Any sequence can be represented in this way. The equation is true if k ranges
More informationEE 123: Digital Signal Processing Spring Lecture 23 April 10
EE 123: Digital Signal Processing Spring 2007 Lecture 23 April 10 Lecturer: Anant Sahai Scribe: Chuo J. Liu 23.1 Outline In this lecture, we talked about implementation issue for rational transfer function.
More informationDigital Signal Processing Lecture 5
Remote Sensing Laboratory Dept. of Information Engineering and Computer Science University of Trento Via Sommarive, 14, I-38123 Povo, Trento, Italy Digital Signal Processing Lecture 5 Begüm Demir E-mail:
More informationNAME: 11 December 2013 Digital Signal Processing I Final Exam Fall Cover Sheet
NAME: December Digital Signal Processing I Final Exam Fall Cover Sheet Test Duration: minutes. Open Book but Closed Notes. Three 8.5 x crib sheets allowed Calculators NOT allowed. This test contains four
More informationDiscrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections
Discrete-Time Signals and Systems The z-transform and Its Application Dr. Deepa Kundur University of Toronto Reference: Sections 3. - 3.4 of John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing:
More informationLinear Convolution Using FFT
Linear Convolution Using FFT Another useful property is that we can perform circular convolution and see how many points remain the same as those of linear convolution. When P < L and an L-point circular
More informationProperties of LTI Systems
Properties of LTI Systems Properties of Continuous Time LTI Systems Systems with or without memory: A system is memory less if its output at any time depends only on the value of the input at that same
More informationLecture 04: Discrete Frequency Domain Analysis (z-transform)
Lecture 04: Discrete Frequency Domain Analysis (z-transform) John Chiverton School of Information Technology Mae Fah Luang University 1st Semester 2009/ 2552 Outline Overview Lecture Contents Introduction
More informationEE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley
EE123 Digital Signal Processing Today Last time: DTFT - Ch 2 Today: Continue DTFT Z-Transform Ch. 3 Properties of the DTFT cont. Time-Freq Shifting/modulation: M. Lustig, EE123 UCB M. Lustig, EE123 UCB
More informationAPPLIED SIGNAL PROCESSING
APPLIED SIGNAL PROCESSING DIGITAL FILTERS Digital filters are discrete-time linear systems { x[n] } G { y[n] } Impulse response: y[n] = h[0]x[n] + h[1]x[n 1] + 2 DIGITAL FILTER TYPES FIR (Finite Impulse
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Processing Prof. Mark Fowler Note Set #21 Using the DFT to Implement FIR Filters Reading Assignment: Sect. 7.3 of Proakis & Manolakis Motivation: DTFT View of Filtering There are
More informationMultimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2
Multimedia Signals and Systems - Audio and Video Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Kunio Takaya Electrical and Computer Engineering University of Saskatchewan December
More informationReview of Fundamentals of Digital Signal Processing
Chapter 2 Review of Fundamentals of Digital Signal Processing 2.1 (a) This system is not linear (the constant term makes it non linear) but is shift-invariant (b) This system is linear but not shift-invariant
More informationUse: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)}
1 VI. Z Transform Ch 24 Use: Analysis of systems, simple convolution, shorthand for e jw, stability. A. Definition: X(z) = x(n) z z - transforms Motivation easier to write Or Note if X(z) = Z {x(n)} z
More informationR13 SET - 1
R13 SET - 1 III B. Tech II Semester Regular Examinations, April - 2016 DIGITAL SIGNAL PROCESSING (Electronics and Communication Engineering) Time: 3 hours Maximum Marks: 70 Note: 1. Question Paper consists
More informationDiscrete Time Systems
Discrete Time Systems Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz 1 LTI systems In this course, we work only with linear and time-invariant systems. We talked about
More informationLecture 7 - IIR Filters
Lecture 7 - IIR Filters James Barnes (James.Barnes@colostate.edu) Spring 204 Colorado State University Dept of Electrical and Computer Engineering ECE423 / 2 Outline. IIR Filter Representations Difference
More informationZ Transform (Part - II)
Z Transform (Part - II). The Z Transform of the following real exponential sequence x(nt) = a n, nt 0 = 0, nt < 0, a > 0 (a) ; z > (c) for all z z (b) ; z (d) ; z < a > a az az Soln. The given sequence
More informationMultidimensional digital signal processing
PSfrag replacements Two-dimensional discrete signals N 1 A 2-D discrete signal (also N called a sequence or array) is a function 2 defined over thex(n set 1 of, n 2 ordered ) pairs of integers: y(nx 1,
More informationDigital Signal Processing:
Digital Signal Processing: Mathematical and algorithmic manipulation of discretized and quantized or naturally digital signals in order to extract the most relevant and pertinent information that is carried
More information1 1.27z z 2. 1 z H 2
E481 Digital Signal Processing Exam Date: Thursday -1-1 16:15 18:45 Final Exam - Solutions Dan Ellis 1. (a) In this direct-form II second-order-section filter, the first stage has
More information(Refer Slide Time: )
Digital Signal Processing Prof. S. C. Dutta Roy Department of Electrical Engineering Indian Institute of Technology, Delhi FIR Lattice Synthesis Lecture - 32 This is the 32nd lecture and our topic for
More informationEE123 Digital Signal Processing
EE123 Digital Signal Processing Discrete Time Fourier Transform M. Lustig, EECS UC Berkeley A couple of things Read Ch 2 2.0-2.9 It s OK to use 2nd edition Class webcast in bcourses.berkeley.edu or linked
More informationDigital Filter Structures. Basic IIR Digital Filter Structures. of an LTI digital filter is given by the convolution sum or, by the linear constant
Digital Filter Chapter 8 Digital Filter Block Diagram Representation Equivalent Basic FIR Digital Filter Basic IIR Digital Filter. Block Diagram Representation In the time domain, the input-output relations
More informationExamples. 2-input, 1-output discrete-time systems: 1-input, 1-output discrete-time systems:
Discrete-Time s - I Time-Domain Representation CHAPTER 4 These lecture slides are based on "Digital Signal Processing: A Computer-Based Approach, 4th ed." textbook by S.K. Mitra and its instructor materials.
More informationDFT-Based FIR Filtering. See Porat s Book: 4.7, 5.6
DFT-Based FIR Filtering See Porat s Book: 4.7, 5.6 1 Motivation: DTFT View of Filtering There are two views of filtering: * Time Domain * Frequency Domain x[ X f ( θ ) h[ H f ( θ ) Y y[ = h[ * x[ f ( θ
More informationInterchange of Filtering and Downsampling/Upsampling
Interchange of Filtering and Downsampling/Upsampling Downsampling and upsampling are linear systems, but not LTI systems. They cannot be implemented by difference equations, and so we cannot apply z-transform
More informationEE-210. Signals and Systems Homework 7 Solutions
EE-20. Signals and Systems Homework 7 Solutions Spring 200 Exercise Due Date th May. Problems Q Let H be the causal system described by the difference equation w[n] = 7 w[n ] 2 2 w[n 2] + x[n ] x[n 2]
More informationReview of Discrete-Time System
Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.
More informationStability Condition in Terms of the Pole Locations
Stability Condition in Terms of the Pole Locations A causal LTI digital filter is BIBO stable if and only if its impulse response h[n] is absolutely summable, i.e., 1 = S h [ n] < n= We now develop a stability
More informationEE123 Digital Signal Processing
EE123 Digital Signal Processing Lecture 2B D. T. Fourier Transform M. Lustig, EECS UC Berkeley Something Fun gotenna http://www.gotenna.com/# Text messaging radio Bluetooth phone interface MURS VHF radio
More informationSignals and Systems. Problem Set: The z-transform and DT Fourier Transform
Signals and Systems Problem Set: The z-transform and DT Fourier Transform Updated: October 9, 7 Problem Set Problem - Transfer functions in MATLAB A discrete-time, causal LTI system is described by the
More informationECE4270 Fundamentals of DSP Lecture 20. Fixed-Point Arithmetic in FIR and IIR Filters (part I) Overview of Lecture. Overflow. FIR Digital Filter
ECE4270 Fundamentals of DSP Lecture 20 Fixed-Point Arithmetic in FIR and IIR Filters (part I) School of ECE Center for Signal and Information Processing Georgia Institute of Technology Overview of Lecture
More informationEE123 Digital Signal Processing
EE123 Digital Signal Processing Lecture 5 based on slides by J.M. Kahn Info Last time Finished DTFT Ch. 2 z-transforms Ch. 3 Today: DFT Ch. 8 Reminders: HW Due tonight The effects of sampling What is going
More informationQUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)
QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) 1. For the signal shown in Fig. 1, find x(2t + 3). i. Fig. 1 2. What is the classification of the systems? 3. What are the Dirichlet s conditions of Fourier
More informationOther types of errors due to using a finite no. of bits: Round- off error due to rounding of products
ECE 8440 Unit 12 More on finite precision representa.ons (See sec.on 6.7) Already covered: quan.za.on error due to conver.ng an analog signal to a digital signal. 1 Other types of errors due to using a
More informationELEG 5173L Digital Signal Processing Ch. 5 Digital Filters
Department of Electrical Engineering University of Aransas ELEG 573L Digital Signal Processing Ch. 5 Digital Filters Dr. Jingxian Wu wuj@uar.edu OUTLINE 2 FIR and IIR Filters Filter Structures Analog Filters
More informationz-transforms Definition of the z-transform Chapter
z-transforms Chapter 7 In the study of discrete-time signal and systems, we have thus far considered the time-domain and the frequency domain. The z- domain gives us a third representation. All three domains
More informationDIGITAL SIGNAL PROCESSING
IT 1252 DIGITAL SIGNAL PROCESSING 1. Define Discrete time signal. A discrete time signal x (n) is a function of an independent variable that is an integer.a discrete time signal is not defined at instant
More informationIT DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING IT6502 - DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A 1. What is a continuous and discrete time signal? Continuous
More information