VII. Discrete Fourier Transform (DFT) Chapter-8. A. Modulo Arithmetic. (n) N is n modulo N, n is an integer variable.
|
|
- Paula Tyler
- 6 years ago
- Views:
Transcription
1 1 VII. Discrete Fourier Transform (DFT) Chapter-8 A. Modulo Arithmetic (n) N is n modulo N, n is an integer variable. (n) N = n m N 0 n m N N-1, pick m Ex. (k) 4 W N = e -j2π/n
2 2 Note that W N k = 0 but W N mk = N if m is a multiple of N but 0, elsewhere Theorem : W N mk = N δ(m) N Proof: Case 1, m = k N for some k Then W nm N = (W N N ) nk = 1 nk = 1 and W nm N = N Case 2 m k N, then (W N m ) n = (1- W N mn ) (1-1) (1- W N m ) (1 - W N m )
3 3 QED 0 = = 0 (1- W N m ) B. Basic Definitions: (1) Forward and inverse transforms X(k) = x(n) W N nk x(n) = (1/N) X(k) W N -nk Proof of inverse transform Substitute X(k) into x(n) expression x(n) = (1/N) ( x(m) W N mk ) W N -nk
4 4 = (1/N) ( x(m) W N k(m-n) ) = x(m) δ(m-n) = x(n) (2) Relationships between DFT, DTFT, Z-transforms. Let x(n) be a causal, finite length sequence, non-zero between n =0 and n = N-1 X(e jw ) = x(n) (e -jw ) n X(z) = x(n) (Z -1 ) n X(k) = x(n) (e -j2πk/n ) n X(k) = X(e j2πk/n ) = X(W N -k )
5 5 (3) Linear Algebra Viewpoint X(k) = x(n) W N nk a(k,n)x(n) X = A x a(k,n) X = X(0) x = x(0) X(1) x(1).... X(N-1) x(n-1) A = a(0,0) a(0,1) a(0,n-1) a(0,0)... a(n-1,0) a(n-1,n-1) x = A -1 X
6 6 (4) Fast Fourier Transform (FFT) The FFT is a special Algorithm for calculating the DFT efficiently. The DFT is usually performed in the real world using an FFT sub-programs. Many are available. Historically: (1) The FFT was invented and reinvented many times. (2) It was last reinvented and popularized by Cooley and Tukey in the mid 1960s. (3) It was probably first invented during world war II. Then it was used to generate artillery tables and was performed by
7 7 groups of women sitting at desks and operating adding and multiplying machines. DFT Efficiency X(k) = x(n) W N nk = N multiplies per output point. = 2N real multiplies if x(n) real. Therefore 2N 2 real multiplies for total transform if x(n) real. Same for inverse DFT. FFT Efficiency N log 2 (N) complex mult or 4Nlog 2 (N) real mult in general case. 2Nlog 2 (N) real mult for forward or inverse transform if x(n) was real.
8 8 (5) Simple Transform Examples Ex. x(n) = δ(n), X(k) = δ(n) W N nk =1 Inverse x(n) = (1/N) W N -nk = δ(n) N = δ(n) Ex. δ(n-m)
9 9 Ex. x(n) = a n (u(n) u(n-m) ) Assume M N X(k) = a n W N nk = (a W N k ) n = 1 a M W N km 1- aw N k C. Rules for evaluating DFT Sums X(k) = x(a+bm) W N km (1) Make sure that all dummy variables on one side of the equal sign are different. Make sure that the final variables are not used anywhere as dummy variables.
10 (2) Evaluate the expression using one of the following 2 techniques. (a) Standard Method 10 (i) Replace (1/N) W N km by δ(m) N (ii) Replace x(a+bm) δ(m-u) by x(a+bu) N (iii) Replace x(a+bu) N by x(a+bu) if 0 a+bu N-1 always. (b) Fast Method. (i) Replace (1/N) W N km by δ(m) (ii) Replace x(a+bm) δ(m-u)
11 11 by x(a+bu) (iii) Replace x(a+bu) by x(a+bu) N if 0 a+bu N-1 can be violated. D. Circular Convolution. Questions: (1) DFT outputs always have N samples. How does this effect convolution. (2) Can non-causal operations be performed? 1. Derivation. Let X(k) = DFT { x(n) } = x(m) W N mk
12 12 H(k) = DFT { h(n) } = h(i) W N ik Final Expression for y(n) is DFT -1 {H(k) X(k) } = (1/N) ( x(m) h(i) W N mk W N ik ) W N -nk = (1/N) x(m) h(i) W N k(m+i-n) = x(m) h(i) δ(m+i-n) = x(m) h(n-m) = x(m) h(n-m) + x(m) h(n-m + N)
13 13
14 14 E. Ordinary Convolution using DFT 1.CAUSAL FILTER AND CAUSAL INPUT.
15 15 Goal: When is circular convolution the same as regular convolution? Guess: N 1 + M 1 2 N-1 Derivation: x(m) h(n-m) N = x(m) h(n-m) + x(m) h(n-m +N) Case 1: 0 n N 1-2 Is h(n-m+n) = 0? Min(n-m+N) = min(n) max(m) +N = 0 (N 1-1) +N = N N Max(n-m+N) = max(n) min(m)+n = N-1 Therefore h(k) = 0 for N N 1 +1 k N-1 so N N M 1 sufficient to guarantee results so N 1 + M 1 1 N, same as guess.
16 16 Case 2: n N 1-1 x(m) h(n-m) N = x(m) h(n-m) 2. Non- Causal filtering of Causal input Goals: (1) Find out how to store non-causal h(n) into causal, N sample sequence h(n). (2) Find conditions on M and N 1
17 17 y(n) = x(k) h(n-k) = x(k) h(n-k) + x(k) h(n-k) = x(k) h(n-k) + x(k) h(n + n-k) Therefore need h(n-k) = h(n+n-k) Let n =0, then h(n-k) = h(-k) for 1 k M
18 18 Restrictions on M, N, N 1 # filter points + # input points- 1 N (1+2M) + N 1 1 N or 2M + N 1 N or M 1 = 1 + 2M
19 19 E. Properties of the DFT (1) Shift Theorem DFT -1 { W N ik X(k)} = (1/N) W N ki ( x(m) W N mk ) W N -nk = (1/N) x(m) W N k(m+i-n) = x(n-i) N (2) Odd and Even Sequences for the DFT x(n) = x ep (n) + x op (n) where x ep (n) = ½ [ x(n) + x * (N-n) N ]
20 20 x op (n) = ½ [ x(n) - x * (N-n) N ] DFT{x ep (n) } = ½ x(n) W N kn + ½ x * (N-n) N W N kn = ½ [ X(k) + X * (k)] = Re {X(k) } Try DFT{x op (n)} (3) Symmetry Relationships for Real sequences If x(n) is real, we know that (i) X(e jw ) = X * (e -jw )
21 21 (ii) X(e jw ) = X(e -jw ) amplitude even. (iii) Arg(X(e jw )) = - arg( X(e -jw )) phase odd. (iv) Re(X(e jw )) = Re(X(e -jw )) real part even (v) Im (X(e jw )) = -Im (X(e -jw )) Im part odd. What are corresponding relationships for DFT, for x(n) real? (i) X(k) = X*(-k) N (ii) X(k) = X(-k) N (iii) arg (X(k)) = -arg (X(-k) N ) (iv) Re(X(k)) = Re(X(-k) N ) (v) Im(X(k)) = -Im(X(-k) N ) Ex (i) X(k) = x(n) W N nk X*(-k) N = ( x(n) W N n(-k) )*
22 22 = ( x(n) W N -nk )* = x(n) W N nk = X(k) F. More Examples Ex Write pseudo-code which reads a, Na, b, Nb, Nfreq, and plots H(e jw(k) ) versus w(k), for k = 0 to Nfreq, w(k) = πk / Nfreq
23 23
24 24 Ex Find the closed form DFT of x(n) = cos(w 1 n) (u(n) u(n-m)) X(k) = ½ (e jw1 n + e -jw1 n ) W N nk = ½ (e jw1 W N k ) n + (e -jw1 W N k ) n (1- (e jw1 W N k ) M (1- (e -jw1 W N k ) M = ½ + (1- (e jw1 W N k )) (1- (e -jw1 W N k )) Ex Find the closed form DFT of na n (u(n)- u(n-n)) x(n) Approach: Find -z X (z) and use z = e jw X(z) = x(n) z -n
25 25 X (z) = - n x(n) z -n-1 z X (z) = z{nx(n)} X(z) = a n z -n = 1 (az -1 ) N 1 (az -1 ) -zx (z) = - z[((1 (az -1 ))a N N z -N-1 (1 (az -1 ) N ) a z -2 ) [ 1 az -1 ] 2 z -1 = W N k
26 26 X(k) = -W N -k [(1-(aW N k ))a N NW N +(N+1)k (1 (aw N k ) N )a W N 2k ] [1 aw N k ] 2 = - [ ( (1 (a W N k ))a N N - a W N k (1 a N )] [1 aw N k ] 2 Ex We have a sequence x(n), 0 n M-1 and we want to calculate X(e jw ) for w = k w, where w is << π (a) What value of N is necessary if this is to be done using DFT (FFT)
27 27 w k for DFT is (2π/N) k = k w 2π/N = w or N = [2π/ w] R [] R denotes rounding to nearest integer (b) What restrictions on M are necessary? (c) Suppose we want to examine X(e jw ) for w 1 w w 2. what is the corresponding range of k in X(k)?
28 28 w 1 = 2π k 1 / N, w 2 = 2π k 2 / N k 1 = Nw 1 / 2π, k 2 = Nw 2 / 2π Ex Design a zero phase LPF h(n) with cut-off w c using the inverse DFT. Truncate the impulse response to length 1+2M. (1) Get k 1 from N and w c w c = 2π k 1 / N k 1 = Nw c / 2π (2) Draw H(k) and show cut-off samples (3) Find h(n) h(n) = DFT -1 (H(k)) = (1/N) (W N -n ) k + (1/N) (W N -n ) k
29 29 1-W N -n(k1 + 1) = (1/N) + 1-W N -n W N n k1-1 1-W N -n = (1/N) W N nk1 - W N -n(k1+1) 1-W N -n = (1/N) W N n(k1+1/2) - W N -n(k1+1/2) W N n/2 W N -n/2 = (1/N) sin( (2π/N)n(k 1 +½) ) sin( (π/n)n)
30 30 Ex Referring to h(n) from previous example, (a) How does h(n) from DFT -1 differ from h(n) for DTFT? (b) Since h(n)( is defined for 0 n N-1, how can we possibly use it for ordinary or straight convolution with the DFT? (a) h(n) = (1/N) sin((2πn/n)(nw c /2π+½)) sin( (π/n)n) = sin( w c n + (πn/n)) N sin( (π/n)n)
31 31 = sin( w c n + (πn/n)) N(π/N)n [sin( w c n) / (πn) ] = h(n) for DTFT (b) Use Truncation. Truncate to 1+2M coefficient h(n) h(n) w(n) Possible Windows
32 32 Parseval s Theorem Ex: (a) Prove that if h(n) is real, h 2 (n) = (1/N) H(k) 2 (b) From the results of part (a), justify the choice of w 1 (n) as a window for zerophase filter design. (c) Replacing h(n) by h(n) h(n), H(k) by H(k) H(k) [ h(n) h(n) w(n)] 2 = (1/N) H(k)- H(k) 2
33 33 = h 2 (n) (1- w(n)) = (1/N) H(k)- H(k) 2 (1- w 1 (n) h(n)) 2 << (1- w 2 (n)) 2 h 2 (n) So choose w 1 (n) (a) h(n) (1/N) H(k) W N -kn = (1/N) H(k) h(n) W N -kn = (1/N) H(k) 2
34 34 Ex: Find y(n) if Y(k) = H(j) X(j+k) N y(n) = (1/N) H(j) X(j+k) N W N -kn = (1/N) H(j) X(j+k) N W N -kn X(k) W N -(k-j)n = (1/N) H(j) W N -j(-n) X(k) W N -kn = N h(-n) N x(n) Ex: Find y(n) if Y(k) = H(j) X(j+k) N Z(j-k) N
35 35 Use H(j) = h(m) W N jm, X(j+k) N = x(i) W N i(j+k) Z(j-k) N = Z(l) W N l(j-k) Y(k)= h(m) x(i) z(l) W N jm+i(j+k)+l(j-k) = N h(-i-l) x(i) z(l) W N k(i-l) y(n) = (1/N) h(-i-l) x(i) z(l) W N k(i-l) W N -kn = N x(l+n) z(l) h(-n-2l) N
36 36 G. Advanced Topics 1. Filter Design for Arbitrary Frequency Responses Goal: Given H(e jw ), find h(n) if F -1 {H(e jw )} is not easily performed. First Try: Pick N, define? w, then w(k) = k? w For 0 k N-1, H(k) = H(e jw(k) ) End h(n) = DFT {H(k)} Stop Problems: (1) H(e jw ) may not be defined for w > p
37 (2) The phase at w = 2p may differ from that at w = 0, so H(e jw(k) ) H(e j(2 p-w(k)) ) Solution, for N Even H(0) = H(e j0 ) For 1 k N/2, H(k) = H(e jw(k) ) H(N-k) = H * (k) End h(n) = DFT {H(k)} Stop Truncation If h(n) is Applied Using the DFT 37
38 If h(n) is Applied in the Time Domain 38
39 2. Sliding DFT for an N-Sample Moving Time Domain Window Goal: In an infinite length real-time sequence x(n), we want a DFT of an N- sample moving window, as X(k) n Then, N 1 m= 0 ( X ) mk N N 1 mk n+1 N m= 0 mk -k N N -k -k -k n N N N n x(n-n+1+m)w X (k) = x(n-n+2+m)w,... m m 1 N = x(n-n+1+m)w W m= 1 = n = X(k)W +x(n+1)w -x(n-n+1)w n 1 X(k) = (k)+x(n)-x(n-n) W -k n-1 N 39
40 40 3. FFT Filtering of Causal, Infinite Length Sequences Goal: Find an FFT method for performing y(n) = h(n)*x(n), where h(n) is nonzero for 0 n N 1-1. The signal x(n) is causal and has an infinite number of samples. Segmenting the Input The convolution can be done efficiently as follows. Divide x(n) into length N 2 segments, and perform 0-fill as x m (n) = x(n+(m-1) N 2 ) for 0 n N for N 2 n N 3-1. x m (n) has N 3 samples.
41 41 Zero-fill for h(n) Now, the impulse response array h(n) is padded with zeroes so that h(n) = 0 for N 1 n N 3-1. Finding the Output First, find the DFT order, N 3. For each value of m, we convolve sequences that end at n = (N 1 1) and (N 2 1). The last non-zero sample of the output y m (n) must be at n = (N 1 1) + (N 2 1), which must be less than or equal to (N 3-1). The DFT order N 3 then satisfies: N 3 (N 1 + N 2 1) Now, Y m (k) = H(k) X m (k) and y m (n) = DFT -1 {Y m (k)}.
42 42 Reconstructing y(n) We construct y(n) as y(n) = y (n-(m-1) N 5 ) m=1 m The delay N 5 should be equal to N 2 so that y(n) = y (n-(m-1) N 2 ) m=1 m System Time Delays Inputs x(n) may become available at a constant sampling rate, but y(n) samples appear in groups N 2. Also, the filter itself will have a time delay. Assume that the filter h(n) is symmetric (even or odd) about sample number N 6, so h(n 6 -k) = h(n 6 +k)
43 for example. The filter s natural time delay is N 6. Minimum Time Delay When sample number (N 2 1) comes into an input block x m (n), assume that 0-fill, forward FFT, and inverse FFT take place in no time. The time delay for x m (N 2 1) is only that for the filter, so 43 Min time delay = N 6 Maximum Time Delay When sample number 0 comes into an input block x m (n), it must wait until the remaining (N 2 1) samples come in, before the 0-fill and FFTs can take place. The time delay for x m (0) is then Max time delay = N 6 + (N 2 1)
44 44 4. Interpolating of the DFT Given X(k), assume that we want to reconstruct X(e jw ) by interpolating X(k). Substituting N 1 1 x(n) = X( kw ) N into k = 0 N 1 jw jwn X( e ) = xne ( ), we get n= 0 1 X( e ) X( kw ) e, = = N 1 N 1 jw nk jwn = N n= 0 N k= 0 N 1 N 1 k= 0 n= 0 N 1 k = 0 where 1 X( k) ( WN e ) N ak ( ) ix( k) nk N k jw n
45 45 N 1 1 ak ( ) = ( WN e ) N n= 0 k jw n kn jwn 1 1 WN e ak ( ) = k jw N 1 WN e j( w w( k)) N 1 1 e = j( w w( k)) N 1 e 1 N sin(( w wk ( )) 2 ) = e 1 i N sin(( w wk ( )) 2) j(( w wk ( )) N 1 2
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform Introduction Representation of periodic sequences: the discrete Fourier series Properties of the DFS The Fourier transform of periodic signals Sampling the Fourier
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 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 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 informationHST.582J / 6.555J / J Biomedical Signal and Image Processing Spring 2007
MIT OpenCourseare http://ocw.mit.edu HST.58J / 6.555J / 16.56J Biomedical Signal and Image Processing Spring 7 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
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 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 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 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 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 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 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 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 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 informationIII. Time Domain Analysis of systems
1 III. Time Domain Analysis of systems Here, we adapt properties of continuous time systems to discrete time systems Section 2.2-2.5, pp 17-39 System Notation y(n) = T[ x(n) ] A. Types of Systems Memoryless
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 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 information8 The Discrete Fourier Transform (DFT)
8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration
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 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 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 (DFT)
Discrete Fourier transform (DFT) Signal Processing 2008/9 LEA Instituto Superior Técnico Signal Processing LEA (IST) Discrete Fourier transform 1 / 34 Periodic signals Consider a periodic signal x[n] with
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 information! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals
ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling
More informationChirp Transform for FFT
Chirp Transform for FFT Since the FFT is an implementation of the DFT, it provides a frequency resolution of 2π/N, where N is the length of the input sequence. If this resolution is not sufficient in a
More informationINTRODUCTION TO THE DFS AND THE DFT
ITRODUCTIO TO THE DFS AD THE DFT otes: This brief handout contains in very brief outline form the lecture notes used for a video lecture in a previous year introducing the DFS and the DFT. This material
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 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 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 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 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 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 informationDiscrete-Time Fourier Transform
C H A P T E R 7 Discrete-Time Fourier Transform In Chapter 3 and Appendix C, we showed that interesting continuous-time waveforms x(t) can be synthesized by summing sinusoids, or complex exponential signals,
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 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 informationDigital Signal Processing Lecture 10 - Discrete Fourier Transform
Digital Signal Processing - Discrete Fourier Transform Electrical Engineering and Computer Science University of Tennessee, Knoxville November 12, 2015 Overview 1 2 3 4 Review - 1 Introduction Discrete-time
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 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 informationLAB 6: FIR Filter Design Summer 2011
University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 6: FIR Filter Design Summer 011
More informationTopics: Discrete transforms; 1 and 2D Filters, sampling, and scanning
EE 637 Study Solutions - Assignment 3 Topics: Discrete transforms; and D Filters, sampling, and scanning Spring 00 Exam : Problem 3 (sampling Consider a sampling system were the input, s(t = sinc(t, is
More informationQuestion Bank. UNIT 1 Part-A
FATIMA MICHAEL COLLEGE OF ENGINEERING & TECHNOLOGY Senkottai Village, Madurai Sivagangai Main Road, Madurai -625 020 An ISO 9001:2008 Certified Institution Question Bank DEPARTMENT OF ELECTRONICS AND COMMUNICATION
More informationCh.11 The Discrete-Time Fourier Transform (DTFT)
EE2S11 Signals and Systems, part 2 Ch.11 The Discrete-Time Fourier Transform (DTFT Contents definition of the DTFT relation to the -transform, region of convergence, stability frequency plots convolution
More informationDigital Signal Processing. Midterm 1 Solution
EE 123 University of California, Berkeley Anant Sahai February 15, 27 Digital Signal Processing Instructions Midterm 1 Solution Total time allowed for the exam is 8 minutes Some useful formulas: Discrete
More informationChap 2. Discrete-Time Signals and Systems
Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,
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 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 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 informationLecture 19: Discrete Fourier Series
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 19: Discrete Fourier Series Dec 5, 2001 Prof: J. Bilmes TA: Mingzhou
More informationQuestion Paper Code : AEC11T02
Hall Ticket No Question Paper Code : AEC11T02 VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad Four Year B. Tech III Semester Tutorial Question Bank 2013-14 (Regulations: VCE-R11)
More informationA. Relationship of DSP to other Fields.
1 I. Introduction 8/27/2015 A. Relationship of DSP to other Fields. Common topics to all these fields: transfer function and impulse response, Fourierrelated transforms, convolution theorem. 2 y(t) = h(
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 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 20: Discrete Fourier Transform and FFT
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept of Electrical Engineering Lecture 20: Discrete Fourier Transform and FFT Dec 10, 2001 Prof: J Bilmes TA:
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 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 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 informationDiscrete-Time Fourier Transform (DTFT)
Discrete-Time Fourier Transform (DTFT) 1 Preliminaries Definition: The Discrete-Time Fourier Transform (DTFT) of a signal x[n] is defined to be X(e jω ) x[n]e jωn. (1) In other words, the DTFT of x[n]
More informationLAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011
University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 2: DTFT, DFT, and DFT Spectral
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 informationDiscrete Time Fourier Transform (DTFT)
Discrete Time Fourier Transform (DTFT) 1 Discrete Time Fourier Transform (DTFT) The DTFT is the Fourier transform of choice for analyzing infinite-length signals and systems Useful for conceptual, pencil-and-paper
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 6: January 30, 2018 Inverse z-transform Lecture Outline! z-transform " Tie up loose ends " Regions of convergence properties! Inverse z-transform " Inspection " Partial
More informationECE538 Final Exam Fall 2017 Digital Signal Processing I 14 December Cover Sheet
ECE58 Final Exam Fall 7 Digital Signal Processing I December 7 Cover Sheet Test Duration: hours. Open Book but Closed Notes. Three double-sided 8.5 x crib sheets allowed This test contains five problems.
More information3.2 Complex Sinusoids and Frequency Response of LTI Systems
3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science Discrete-Time Signal Processing Fall 2005
1 MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.341 Discrete-Time Signal Processing Fall 2005 FINAL EXAM Friday, December 16, 2005 Walker (50-340) 1:30pm
More informationVU Signal and Image Processing
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/18s/
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 information6.02 Fall 2012 Lecture #11
6.02 Fall 2012 Lecture #11 Eye diagrams Alternative ways to look at convolution 6.02 Fall 2012 Lecture 11, Slide #1 Eye Diagrams 000 100 010 110 001 101 011 111 Eye diagrams make it easy to find These
More informationDiscrete Fourier Transform
Discrete Fourier Transform Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz Diskrete Fourier transform (DFT) We have just one problem with DFS that needs to be solved.
More informationEDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT. March 11, 2015
EDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT March 11, 2015 Transform concept We want to analyze the signal represent it as built of some building blocks (well known signals), possibly
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 information7.16 Discrete Fourier Transform
38 Signals, Systems, Transforms and Digital Signal Processing with MATLAB i.e. F ( e jω) = F [f[n]] is periodic with period 2π and its base period is given by Example 7.17 Let x[n] = 1. We have Π B (Ω)
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 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 informationECE 413 Digital Signal Processing Midterm Exam, Spring Instructions:
University of Waterloo Department of Electrical and Computer Engineering ECE 4 Digital Signal Processing Midterm Exam, Spring 00 June 0th, 00, 5:0-6:50 PM Instructor: Dr. Oleg Michailovich Student s name:
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 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 informationFast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding
Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fourier Series & Transform Summary x[n] = X[k] = 1 N k= n= X[k]e jkω
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 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 informationUNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 9th, 011 Examination hours: 14.30 18.30 This problem set
More informationFrequency-Domain C/S of LTI Systems
Frequency-Domain C/S of LTI Systems x(n) LTI y(n) LTI: Linear Time-Invariant system h(n), the impulse response of an LTI systems describes the time domain c/s. H(ω), the frequency response describes the
More informationAssignment 2. Signal Processing and Speech Communication Lab. Graz University of Technology
Signal Processing and Speech Communication Lab. Graz University of Technology Assignment 2 This homework has to be submitted via e-mail to the address hw1.spsc@tugraz.at not later than 25.5.2016. Let the
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 informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 6: January 31, 2017 Inverse z-transform Lecture Outline! z-transform " Tie up loose ends " Regions of convergence properties! Inverse z-transform " Inspection " Partial
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 informationFast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding
Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding J. McNames Portland State University ECE 223 FFT Ver. 1.03 1 Fourier Series
More information6.003: Signal Processing
6.003: Signal Processing Discrete Fourier Transform Discrete Fourier Transform (DFT) Relations to Discrete-Time Fourier Transform (DTFT) Relations to Discrete-Time Fourier Series (DTFS) October 16, 2018
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 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 informationDiscrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is
Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its
More informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 3 Signals & Systems Prof. ark Fowler Note Set #28 D-T Systems: DT Filters Ideal & Practical /4 Ideal D-T Filters Just as in the CT case we can specify filters. We looked at the ideal filter for the
More informationChapter 3 Fourier Representations of Signals and Linear Time-Invariant Systems
Chapter 3 Fourier Representations of Signals and Linear Time-Invariant Systems Introduction Complex Sinusoids and Frequency Response of LTI Systems. Fourier Representations for Four Classes of Signals
More informationFourier analysis of discrete-time signals. (Lathi Chapt. 10 and these slides)
Fourier analysis of discrete-time signals (Lathi Chapt. 10 and these slides) Towards the discrete-time Fourier transform How we will get there? Periodic discrete-time signal representation by Discrete-time
More informationELEG 305: Digital Signal Processing
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
More informationChapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum
Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum CEN352, DR. Nassim Ammour, King Saud University 1 Fourier Transform History Born 21 March 1768 ( Auxerre ). Died 16 May 1830 ( Paris ) French
More informationFilter Design Problem
Filter Design Problem Design of frequency-selective filters usually starts with a specification of their frequency response function. Practical filters have passband and stopband ripples, while exhibiting
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 informationUniversity Question Paper Solution
Unit 1: Introduction University Question Paper Solution 1. Determine whether the following systems are: i) Memoryless, ii) Stable iii) Causal iv) Linear and v) Time-invariant. i) y(n)= nx(n) ii) y(t)=
More informationELEN 4810 Midterm Exam
ELEN 4810 Midterm Exam Wednesday, October 26, 2016, 10:10-11:25 AM. One sheet of handwritten notes is allowed. No electronics of any kind are allowed. Please record your answers in the exam booklet. Raise
More informationZ-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1.
84 5. Z-TRANSFORMS 5 z-transforms Solution: Using the definition (5..2), we find: for case (a), and H(z) h 0 + h z + h 2 z 2 + h 3 z 3 2 + 3z + 5z 2 + 2z 3 H(z) h 0 + h z + h 2 z 2 + h 3 z 3 + h 4 z 4
More information