Documente Academic
Documente Profesional
Documente Cultură
Information source
Source Coding Channel Coding Modulator
and input transducer
• Questions to be answered:
1
Elec3100 Chapter 3
Ch3.2: Discrete Fourier Transform
2
Elec3100 Chapter 3
WiFi and OFDM
3
Elec3100 Chapter 3
Discrete Time Fourier Transform (DTFT)
5
Elec3100 Chapter 3
Inverse Discrete Fourier Transform (IDFT)
• The sequence is called the discrete Fourier transform
(DFT) of sequence .
• Utilizing the notation , DFT is usually expressed as
,0 1
6
Elec3100 Chapter 3
Inverse Discrete Fourier Transform (IDFT)
• From the definition of the inverse discrete Fourier transform
(IDFT), ∑ .
• By substituting ∑ , we can obtain
∑ ∑
∑ ∑
∑ ∑
, for , an integer
• Given ∑ ,
0, otherwise
we have .
7
Elec3100 Chapter 3
Discrete Fourier Transform
• Example: Consider the length-N sequence
1, 0
0, 1 1
• Its N-point DFT is given by
1, 0 1
8
Elec3100 Chapter 3
Discrete Fourier Transform
• Example: Determine DFT of the length-N sequence
cos ,0 1
• Using the trigonometric identity, we can obtain
/ /
=
• The N-point DFT is given by
∑ ∑ ∑
, for , an integer
• Using the identity, ∑
0, otherwise
, for
we get , for
0, otherwise
9
Elec3100 Chapter 3
Matrix Relations
• The DFT samples defined by
,0 1
10
Elec3100 Chapter 3
Matrix Relations
• The IDFT relation can be expressed as
∗
where is the IDFT matrix with where
11
Elec3100 Chapter 3
DFT Properties: Symmetry Relations
Elec3100 Lecture 3 12
General Properties of DFT
13
Elec3100 Chapter 3
Physical Interpretation
• Decomposition of a finite-length signal into a set
of N sinusoidal components
– Take an array of N complex sinusoidal generators;
– Set the frequency of the k-th generator to 2 / ;
– Set the amplitude of the k-th generator to , i.e. to the
magnitude of the k-th DFT coefficient;
– Set the phase of the k-th generator to ∡ , i.e. to the phase
of the k-th DFT coefficient;
– Start the generators at the same time and sum their outputs.
• The first N output values of this “machine” are exactly x[n].
14
Elec3100 Chapter 3
Physical Interpretation: Example
cos 0, … , 63
8
15
Elec3100 Chapter 3
Physical Interpretation: Example
cos 0, … , 63
8 3
16
Elec3100 Chapter 3
Physical Interpretation: Example
cos 0, … , 63
5
17
Elec3100 Chapter 3
Ch3.2: Frequency Analysis for DT Signals
18
Elec3100 Chapter 3
Circular Shift of a Sequence
• Consider a length-N sequence defined for 0 1.
Sample values are equal to zero for values of 0 and .
• Thus, we need to define another type of “shift” that will always keep
the shifted sequence in the range 0 1.
,0 2 2
21
Elec3100 Chapter 3
Circular Convolution
• To develop a convolution-like operation resulting in a length-N
sequence , we need to define a circular time-reversal, and then
apply a circular time-shift.
22
Elec3100 Chapter 3
Circular Convolution
• Example – Determine the 4-point circular convolution of two length-
4 sequences: 1 2 0 1 and 2 2 1 1 as sketched
below
23
Elec3100 Chapter 3
Circular Convolution: DFT Method
• Example – Determine the 4-point circular convolution of two length-
4 sequences: 1 2 0 1 and 2 2 1 1 as sketched
below
24
Elec3100 Chapter 3
Circular Convolution
• Example – Now let us extend the two length-4 sequences to
length-7 by appending each with three zero-valued samples
25
Elec3100 Chapter 3
Circular Convolution
26
Elec3100 Chapter 3
Circular Convolution
27
Elec3100 Chapter 3
Circular Convolution
28
Elec3100 Chapter 3
Circular Convolution
29
Elec3100 Chapter 3
Linear Convolution Using the DFT
• Linear convolution is a key operation in many signal processing
applications.
30
Elec3100 Chapter 3
Linear Convolution Using the DFT
31
Elec3100 Chapter 3