lec 19: apr 2, 2019 discrete fourier transformese531/spring2019/handouts/lec19.pdf · big ideas !...
TRANSCRIPT
![Page 1: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/1.jpg)
ESE 531: Digital Signal Processing
Lec 19: Apr 2, 2019 Discrete Fourier Transform
Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 2: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/2.jpg)
Today
! Discrete Fourier Series ! Discrete Fourier Transform (DFT) ! DFT Properties ! Circular Convolution
2 Penn ESE 531 Spring 2019 - Khanna
![Page 3: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/3.jpg)
Discrete Fourier Series
Penn ESE 531 Spring 2019 - Khanna 3
![Page 4: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/4.jpg)
Reminder: Eigenvalue (DTFT)
! x[n]=ejωn
4 Penn ESE 531 Spring 2019 - Khanna
y[n]= x[n− k]h[k]k=−∞
∞
∑
= e jω (n−k )h[k]k=−∞
∞
∑
= e jωn h[k]k=−∞
∞
∑ e− jωk
= H (e jω )e jωn
H (e jω ) = h[k]k=−∞
∞
∑ e− jωk
! Describes the change in amplitude and phase of signal at frequency ω
! Frequency response ! Complex value
" Re and Im " Mag and Phase
![Page 5: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/5.jpg)
Discrete Fourier Series
! Definition: " Consider N-periodic signal:
" Frequency-domain also periodic in N:
" “~” indicates periodic signal/spectrum
5 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 6: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/6.jpg)
Discrete Fourier Series
! Define:
! DFS:
6 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 7: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/7.jpg)
Discrete Fourier Series
! Properties of WN: " WN
0 = WNN = WN
2N = ... = 1 " WN
k+r = WNkWN
r and, WNk+N = WN
k
7 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 8: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/8.jpg)
Discrete Fourier Series
! Properties of WN: " WN
0 = WNN = WN
2N = ... = 1 " WN
k+r = WNkWN
r and, WNk+N = WN
k
! Example: WNkn (N=6)
8 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 9: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/9.jpg)
Discrete Fourier Series
! Properties of WN: " WN
0 = WNN = WN
2N = ... = 1 " WN
k+r = WNkWN
r and, WNk+N = WN
k
! Example: WNkn (N=6)
9 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 10: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/10.jpg)
Discrete Fourier Transform
! By convention, work with one period:
10
Same, but different!
Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 11: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/11.jpg)
Discrete Fourier Transform
! The DFT
! It is understood that,
11 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 12: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/12.jpg)
DFS vs. DFT
12 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 13: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/13.jpg)
DFS vs. DFT
13 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 14: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/14.jpg)
Example
14 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 15: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/15.jpg)
Example
15 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 16: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/16.jpg)
Discrete Fourier Series
! Properties of WN: " WN
0 = WNN = WN
2N = ... = 1 " WN
k+r = WNkWN
r and, WNk+N = WN
k
! Example: WNkn (N=6)
16 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 17: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/17.jpg)
Example
17 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 18: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/18.jpg)
Example
! Q: What if we take N=10? ! A: where is a period-10 seq.
18 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 19: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/19.jpg)
Example
! Q: What if we take N=10? ! A: where is a period-10 seq.
19 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 20: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/20.jpg)
Example
! Now, sum from n=0 to 9
20
9
Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 21: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/21.jpg)
Example
! Now, sum from n=0 to 9
21
9
4
Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 22: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/22.jpg)
DFT vs. DTFT
! For finite sequences of length N: " The N-point DFT of x[n] is:
" The DTFT of x[n] is:
22 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 23: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/23.jpg)
DFT vs. DTFT
! The DFT are samples of the DTFT at N equally spaced frequencies
23 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 24: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/24.jpg)
4
DFT vs DTFT
! Back to example
24 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 25: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/25.jpg)
4
DFT vs DTFT
! Back to example
25 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 26: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/26.jpg)
4
DFT vs DTFT
! Back to example
26
Use fftshift to center around dc
Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 27: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/27.jpg)
DFT and Inverse DFT
! Use the DFT to compute the inverse DFT. How?
27 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 28: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/28.jpg)
DFT and Inverse DFT
! Use the DFT to compute the inverse DFT. How?
28 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 29: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/29.jpg)
DFT and Inverse DFT
! Use the DFT to compute the inverse DFT. How?
29 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 30: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/30.jpg)
DFT and Inverse DFT
! Use the DFT to compute the inverse DFT. How?
30 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 31: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/31.jpg)
DFT and Inverse DFT
! Use the DFT to compute the inverse DFT. How?
31 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 32: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/32.jpg)
DFT and Inverse DFT
! Use the DFT to compute the inverse DFT. How?
32 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 33: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/33.jpg)
DFT and Inverse DFT
! So
33 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 34: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/34.jpg)
DFT and Inverse DFT
! So
34 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 35: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/35.jpg)
DFT and Inverse DFT
! So
! Implement IDFT by:
" Take complex conjugate " Take DFT " Multiply by 1/N " Take complex conjugate
35 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 36: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/36.jpg)
DFT as Matrix Operator
36 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 37: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/37.jpg)
DFT as Matrix Operator
37 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 38: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/38.jpg)
DFT as Matrix Operator
38 N2 complex multiples Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 39: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/39.jpg)
DFT as Matrix Operator
! Can write compactly as
39 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 40: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/40.jpg)
Properties of the DFT
! Properties of DFT inherited from DFS ! Linearity
! Circular Time Shift
40 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 41: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/41.jpg)
Circular Shift
41 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 42: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/42.jpg)
Circular Shift
42 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 43: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/43.jpg)
Properties of DFT
! Circular frequency shift
! Complex Conjugation
! Conjugate Symmetry for Real Signals
43 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 44: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/44.jpg)
Example: Conjugate Symmetry
44 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 45: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/45.jpg)
Example: Conjugate Symmetry
45 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 46: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/46.jpg)
Example: Conjugate Symmetry
46 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 47: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/47.jpg)
Example: Conjugate Symmetry
47 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 48: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/48.jpg)
Example: Conjugate Symmetry
48 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 49: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/49.jpg)
Example
49 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 50: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/50.jpg)
Properties of the DFS/DFT
Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 51: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/51.jpg)
Properties (Continued)
Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 52: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/52.jpg)
Duality
52 Penn ESE 531 Spring 2019 - Khanna
![Page 53: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/53.jpg)
Duality
53 Penn ESE 531 Spring 2019 - Khanna
![Page 54: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/54.jpg)
Proof of Duality
54 Penn ESE 531 Spring 2019 - Khanna
![Page 55: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/55.jpg)
Discrete Fourier Series
! Properties of WN: " WN
0 = WNN = WN
2N = ... = 1 " WN
k+r = WNkWN
r and, WNk+N = WN
k
! Example: WNkn (N=6)
55 Penn ESE 531 Spring 2018 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 56: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/56.jpg)
Circular Convolution
! Circular Convolution:
For two signals of length N
56 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 57: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/57.jpg)
Compute Circular Convolution Sum
57 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 58: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/58.jpg)
Compute Circular Convolution Sum
58 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 59: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/59.jpg)
Compute Circular Convolution Sum
59 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
y[0]=2
![Page 60: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/60.jpg)
Compute Circular Convolution Sum
60
y[0]=2
Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 61: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/61.jpg)
Compute Circular Convolution Sum
61
y[0]=2 y[1]=2
Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 62: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/62.jpg)
Compute Circular Convolution Sum
62
y[0]=2 y[1]=2 y[2]=3
Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 63: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/63.jpg)
Compute Circular Convolution Sum
63
y[0]=2 y[1]=2 y[2]=3 y[3]=4
Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 64: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/64.jpg)
Result
64
y[0]=2 y[1]=2 y[2]=3 y[3]=4
Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 65: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/65.jpg)
Circular Convolution
! For x1[n] and x2[n] with length N
" Very useful!! (for linear convolutions with DFT)
65 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 66: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/66.jpg)
Multiplication
! For x1[n] and x2[n] with length N
66 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 67: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/67.jpg)
Linear Convolution
! Next.... " Using DFT, circular convolution is easy " But, linear convolution is useful, not circular " So, show how to perform linear convolution with circular
convolution " Use DFT to do linear convolution
67 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 68: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/68.jpg)
Big Ideas
! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside of defined
length " N-point DFT is sampled DTFT at N points " Useful properties allow easier linear convolution
! DFT Properties " Inherited from DFS, but circular operations!
68 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley
![Page 69: Lec 19: Apr 2, 2019 Discrete Fourier Transformese531/spring2019/handouts/lec19.pdf · Big Ideas ! Discrete Fourier Transform (DFT) " For finite signals assumed to be zero outside](https://reader034.vdocument.in/reader034/viewer/2022042123/5e9e64b39f09401cc54e5f9b/html5/thumbnails/69.jpg)
Admin
! HW 8 out now " Due Sunday
69 Penn ESE 531 Spring 2019 – Khanna Adapted from M. Lustig, EECS Berkeley