In today’s lecture we review the concepts of real frequency domain
analysis, aka Fourier analysis from ECE 2714.
CT Fourier Analysis
Recall that periodic CT signals with period
that meet the Direchlet conditions
The signal has a finite number of discontinuities per
period.
The signal has a finite number of maxima and minima per
period.
The signal is bounded, i.e.
can be decomposed using the CT Fourier series
where
and
.
The Fourier series coefficients are given by
and measure the similarity of
to the signal
.
A plot of
and
as a function of
is called magnitude and phase spectrum.
Example. Recall that sampling of a CT signal can be
thought of as multiplication by the impulse train
The Forier series coefficients are
For non-periodic CT signals the decomposition is over an uncountably
infinite set of frequencies
where the Fourier transform is
A plot of
and
are called the magnitude and phase spectra respectively.
The most usefull property of the CTFT is the convolution property.
Let
be the Fourier transform of the impulse response of a stable system, and
be the Fourier transform of the input signal. Then the output in the
Fourier domain
is
The output in the time domain is then the inverse Fourier transform
of
Note for this to work the Fourier transforms of
and
must exist.
is called the Frequency response of the system and exists if the system
is BIBO stable.
This gives us an alternate route to analysis of stable systems.
Example. Consider a LTI CT system given by the LCCDE
Find the output
if the input is
using Fourier analysis, if possible.
Solution.
Determine the system stability using the roots of the
characteristic equation.
has roots -10 and -2, which are in left-hand side of the complex plane,
thus the system is BIBO stable
Using the derivative, linearity, and convolution properties of
the Fourier transform, find the transform of the impulse response
Using the Fourier transform or a table of transforms and
properties find the Fourier transform of the input
Using the convolution property of the Fourer transform of the
output
Using the inverse Fourier transform or a table of transforms and
properties, find the inverse transform. First, doing a partial fraction
expension
Some algebra gives
,
,
.
Then using a table and properties
DT Fourier Analysis
DT periodic functions can be decomposed as
where
is the period,
,
and
is any starting index for the sum.
The FT Fourier series coefficients
are given by
As before the plot of
and
is called the magnitude and phase spectrum.
Recall that the DTFS is proportional to the DFT/FFT
of a finite-length sequence equivalent to the values of the periodic
signall over just one period.
Example. Compute the DFT by hand of the
finite-length signal
using the DTFS. Confirm your results using Matlab.
Solution.
Periodically extend the signal with period
.
Determine the Fourier series coefficients. Let
,
then from the definition
Finally
for
.
Evaluating numerically gives
,
,
.
Comparing this to the numerical computation of the DFT in
Matlab
octave:1> X = fft([1,2,1])
X =
4.0000 + 0i -0.5000 - 0.8660i -0.5000 + 0.8660i
For non-periodic signals the decompostion is
where the integral is over any
period of
.
The DT Fourier transform is given by
Note
must be a periodic function with period
.
Again a plot of
and
is the spectrum of the signal. It is often only plotted from
or
since it is periodic outside that range and thus redundant
information.
As in CT the most usefull property is related to convolution. Let
be the DT Fourier transform of the system impulse response. Let
be the DT Fourier transform of the input. Then the output in the Fourier
domain is given by
and in the time domain
as long as all the transforms exist.
The function
is called the frequency response of the DT system and exists if the
system is BIBO stable.
This gives an alternate analysis route for DT systems, parallel to
the CT case
Example. Consider the following system where
and system
is unknown.
Draw a block diagram for
such that
,
that is, it is the inverse of the system it is in series with. Use
Fourier analysis to derive your result.
Solution.
Let
be the output of the first system. Then
or in standard advance form
To see if the first system is stable check the roots of
Since both roots have magnitude less than unity
(),
the system is stable.
Using the index shift and linearity properties of the DTFT
Rearranging we get the frequency response for the first system
We look for a frequency response for system 2,
such that
Thus we need
The corresponding LCCDE is
or in recursive form
This corresponds to the block diagram: