Professional Documents
Culture Documents
But if the replicas overlap they will contribute to the right hand side of spectrum
Setting W(n) = 1
Magnitude spectrum
of rectangular window
Frequency resolution
To achieve a desired frequency resolution f.
The smaller the desired separation, the
Longer the data record
The Hamming window
At its center, n=(L-1)/2, the value of w(n) is 0.54+0.46 = 1, and at its endpoint,
n=0 and n=L-1, its value is 0.54-0.46 = 0.08
For any type of window, the effective of the
mainlobe is inversely proportional to L
c is a constant and always c=>1
DSP lectured by Assoc. Prof. Dr. Thuong Le-Tien
Example:
A signal consisting of four sinusoids of frequencies of 1, 1.5, 2.5,
and 2.75 kHz, is sampled at a rate of 10 kHz. What is the minimum
number of samples that should be collected for the frequency
spectrum to exhibit four distinct peaks at these frequencies?
How many samples should be collected if they are going to be
preprocessed by a Hamming window and then Fourier transformed?
Solution:
The smallest frequency separation that must be resolved by the DFT is
f = 2.75-2.5=0.25 kHz, for rectangular window:
Example:
A 10ms portion of a signal is sampled at a rate of 10kHz. It is known
that the signal consists of two sinusoids of frequencies f1=1kHz and
f2=2khz. It is also known that the signal contains a third component
of frequency f3 that lies somewhere between f1 and f2.
a. How close to f1 could f3 be in order for the spectrum of the collected
samples to exhibit three distinct peak? How close to f2 could f3 be?
b.What are the answers if the collected samples are windowed by a
Hamming window?
Solution:
The total number of samples collected is L= fsTL =10x10=100.
The frequency resolution of the rectangular window is
f = fs/L = 10/100 = 0.1kHz
Thus the closest f3 to f1 and f2 will be
f3 = f1 + f = 1.1kHz and f3 = f2 - f = 1.9kHz
In the hamming case, the minimum resolvable frequency separation
doubles, that is,
f = cfs/L = 2.10/100 = 0.2kHz which give f3 = 1.2kHz or f3 = 1.8kHz
DSP lectured by Assoc. Prof. Dr. Thuong Le-Tien
2. DTFT computation
2.1. DTFT at a single frequency
DTFT of length-L signal
10
11
2.3. DFT
The N points DFT of a L-length signal defined the DFT frequency as follows,
The only difference between DFT and DTFT is that the former has its N
frequencies distributed evenly over the full Nyquist interval [0, 2) whereas
the later has them distributed over any desired subinterval.
12
N-point DTFTs over [0,2) and over subinterval [a, b), for N=10
Evaluation of z-transform
13
Note that evaluation at the N frequencies DFT are the same for
the cases of padding D zeros at front or delay D samples
14
Denoted
(matrix form of DFT)
15
16
And the 2-point and 4-point DFT of a length 2 and length 4 signals will be
Thus, the 2-point DFT is formed by taking the sum and difference of the two time
Samples. It will be a convenience starting point for the merging in FFT by hand.
17
17
5. Modulo N reduction
Example L=4N
18
Example: Determine the mod-4 and mod-3 reduction of the length-8 signal vector
For N=4 and N=3
For n=0, 1, 2,
, N-1
19
The connection of the mod-N reduction to the DFT is the theorem that the
Length-N wrapped signal x~ has the same N-point DFT as the original
Unwrapped signal x, that is:
20
The DFT matrices A and A~ have the same definition, except they
differ in their dimensions, which are NxL and NxN, respectively.
We can write the DFT of x~ in the compact matrix form:
21
22
23
Example: Compute the 4-point DFT of the length-8 signal in two way:
(a) Working with the full unwrapped vector x and
(b) Computing the DFT of its mod-4 reduction
Solution: The corresponding DFT is
24
6. Inverse DFT
The problem for inverse DFT is the length L of signal greater than N-point DFT,
i.e. the matrix A is not invertible
The inverse DFT defined by
~*
A
25
26
27
Taking the Nyquist interval to be the right-sided one [0, fs], we note that
harmonics within that interval are none other than the N DFT frequencies
28
29
30
Similarly, for N=8 corresponding to fs=8 Hz, we perform the 8-point DFT of one
period of the square wave, and divide by 8 to get the aliased amplitudes
31
32
The summation index n ranges over both even and odd values
in the range [0,N-1]. By grouping the even-indexed and
odd-indexed terms, we get
0 2n N 2 0 n N / 2 1
Similarly, for the odd-indexed terms, we must have
0 2n 1 N 1
1 2n 1 n 1 0 2n N 2 0 n N / 2 1
DSP lectured by Assoc. Prof. Dr. Thuong Le-Tien
33
34
35
36
and N=8
37
38
39
40
Example: Using FFT algorithm, compute 8-point DFT of the 8 point signal
41
42