Sampling
Continuous signals are digitized using digital computers When we sample, we calculate the value of the continuous signal at discrete points
How fast do we sample What is the value of each point
- Note that wb = Bandwidth, thus if (signal overlaps) -To avoid aliasing -According sampling theory:
A few points
DTFT is periodic in frequency with period of 2p
X[n] is a discrete signal DTFT allows us to find the spectrum of the discrete signal as viewed from a window
Example D
See map!
Example of Convolution
Convolution
We can write x[n] (a periodic function) as an infinite sum of the function xo[n] (a non-periodic function) shifted N units at a time
Thus
See map!
DTFT of xo[n]
Example
Example A & B
notes
DT Fourier Transforms
1. W is in radian and it is between 0 and 2p in each discrete time interval This is different from w where it was between INF and + INF Note that X(W) is periodic
2.
3.
Properties of DTFT
Remember: For time scaling note that m>1 Signal spreading
In this case the xo[n] is just a sampled data between n=0, n=N-1 (N points)
Note that in this case the points are spaced 2pi/N; thus the resolution of the samples of the frequency spectrum is 2pi/N. We can think of DFT as one period of discrete Fourier series
remember:
Inverse of DFT
We can obtain the inverse of DFT
Note that
or
Example of DFT
Find X[k]
We know k=1,.., 7; N=8
Example of DFT
Example of DFT
Example of DFT
Example of DFT
Example of IDFT
Remember:
Example of IDFT
Remember:
Basic idea is to split the sum into 2 subsequences of length N/2 and continue all the way down until you have N/2 subsequences of length 2
Log2(8) N
Lets take a simple example where only two points are given n=0, n=1; N=2
Butterfly FFT y0 y0 y1
Break up the size N/2 subsequent in half by letting 2mm The first subsequence here is the term x[0], x[4], The second subsequent is x[2], x[6],
N / 2 1 m 0
WN / 2 x[2m] WN (
mk k 2 mk
N / 2 1 m 0
WN / 2 x[2m 1])
mk
WN
WN / 2
mk m N /2
WN / 2
N
m N / 2
WN / 2 WN / 2
WN / 2
Example
Lets take a simple example where only two points are given n=0, n=1; N=2
N / 2 1 m 0
X [k ] WN
2 mk
WN / 2 x[2m] WN (
mk k mk m N /2
N / 2 1 m 0
WN / 2 x[2m 1])
mk m
WN / 2
WN / 2
N
m N / 2
WN / 2 WN / 2
WN / 2
1
Same result
X [k 0] W
m 0 0
0.0 1
x[0] W ( W
0 1 m 0 0 1 1
0.0 1
Applet: http://www.falstad.com/fourier/directions.html
http://www.engineeringproductivitytools.com/stuff/T0001/PT07.HTM
Taking the 512-point fast Fourier transform (FFT): Y = fft(y,512) The power spectrum, a measurement of the power at various frequencies, is Pyy = Y.* conj(Y) / 512; Graph the first 257 points (the other 255 points are redundant) on a meaningful frequency axis: f = 1000*(0:256)/512; plot(f,Pyy(1:257)) title('Frequency content of y') xlabel('frequency (Hz)')
ML Help!
Example
Express the DFT of the 9-point {x[0], ,x[9]} in terms of the DFTs of 3-point sequences {x[0],x[3],x[6]}, {x[1],x[4],x[7]}, and {x[2],x[5],x[8]}.
Later
References
Read Schaums Outlines: Chapter 6 Do Chapter 12 problems: 19, 20, 26, 5, 7