Scribd
Upload
12 views19 pages

DSP - Lec 5

The document discusses Fourier analysis and its significance in digital signal processing, highlighting the relationship between convolution and multiplication in linear shift-invariant (LSI) systems. It explains the frequency response of LSI systems, the discrete-time Fourier transform (DTFT), and various properties of the DTFT, including periodicity, linearity, and modulation. Examples are provided to illustrate the concepts, including the recovery of unit sample responses and the calculation of DTFTs.

Uploaded by

chase.willson.incall
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views19 pages

DSP - Lec 5

The document discusses Fourier analysis and its significance in digital signal processing, highlighting the relationship between convolution and multiplication in linear shift-invariant (LSI) systems. It explains the frequency response of LSI systems, the discrete-time Fourier transform (DTFT), and various properties of the DTFT, including periodicity, linearity, and modulation. Examples are provided to illustrate the concepts, including the recovery of unit sample responses and the calculation of DTFTs.

Uploaded by

chase.willson.incall
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

Digital signal Lecture (5)

processing Dr. Christina Gamal


Fourier Analysis
 The Fourier representation of signals plays an extremely important role in both
continuous-time and discrete-time signal processing. It provides a method for
mapping signals into another "domain" in which to manipulate them. What makes
the Fourier representation particularly useful is the property that the convolution
operation is mapped to multiplication.
 FREQUENCY RESPONSE
Eigenfunctions of linear shift-invariant systems are sequences that, when input to
the system, pass through with only a change in (complex) amplitude. That is to say,
if the input is x(n), the output is y(n) = λx(n), where λ, the eigenvalue, generally
depends on the input x(n).
FREQUENCY RESPONSE
 Signals of the form
x( n) = ejnω -∞˂n<∞
where ω is a constant, are eigenfunctions of LSI systems. This may be shown from
the convolution sum:

Thus, the eigenvalue, which we denote by H(ejω ), is


FREQUENCY RESPONSE
 Note that H(ejω ) is, in general, complex-valued and depends on the frequency ω
of the complex exponential. Thus, it may be written in terms of its real and
imaginary parts.

or in terms of its magnitude and phase,

Where

and
Example
 Consider the LSI system with unit sample response
where α is a real number with |α| ˂ 1.
The frequency response is

The squared magnitude of the frequency response is

and the phase is


FREQUENCY RESPONSE
Inverting the Frequency Response

Given the frequency response of a linear shift-invariant system,

the unit sample response may be recovered by integration:

The integral may be taken over any period of length 2П.


Example
Find the unit sample response for a system with a frequency
response given by

 Solution
The unit sample response is
THE DISCRETE-TIME FOURIER TRANSFORM
 The frequency response of a linear shift-invariant system is found by multiplying
h(n) by a complex exponential, e-jnw and summing over n. The discrete-time
Fourier transform (DTFT) of a sequence, x(n), is defined in the same way,

 Thus, the frequency response of a linear shift-invariant system, H(ejω ) ,is the
DTFT of the unit sample response, h(n). In order for the DTFT of a sequence to
exist, the above summation must converge. This, in turn, requires that x(n) be
absolutely summable:
Example
 Find the DTFT of the sequence

 Solution
Example
 Find the DTFT of the sequence

 Solution

Changing the limits on the sum, we have

If |a| > 1, this sum is

Therefore, x1(n) = αn u(n) and x2(n) = - αn u(-n – 1) both have the same DTFT.
Inverse DTFT

 Given X(ejw) ,the sequence x(n) may be recovered using the inverse DTFT,
THE DISCRETE-TIME FOURIER TRANSFORM
 Table below contains a list of some useful DTFT pairs.
Example
 Find the inverse DTFT of the two sequences
X1(ejω) = δ (ω – ωo )
X2(ejω) = П δ (ω – ωo ) + П δ (ω + ωo )
 Solution
Using the inverse DTFT, we have
DTFT PROPERTIES
 Periodicity
The discrete-time Fourier transform is periodic in ω with a period of 2 П :

This property follows directly from the definition of the DTFT and the periodicity of
the complex exponentials
DTFT PROPERTIES
 Linearity
The discrete-time Fourier transform is a linear operator. That is to say, if X1(ejω) is
the DTFT of x1(n), and X2(ejω) is the DTFT of x2(n),

 Shifting Property
Shifting a sequence in time results in the multiplication of the DTFT by
a complex exponential
 Time-Reversal
Time-reversing a sequence results in a frequency reversal of the DTFT
DTFT PROPERTIES
 Modulation
Multiplying a sequence by a complex exponential results in a shift in frequency of
the DTFT

 Convolution
convolution in the time domain is equivalent to multiplication in the frequency
domain.
Problems

You can get it


directly

17
18
Example
Consider the linear shift-invariant system characterized by the second-
order linear constant coefficient difference equation, find the frequency
response
y(n) =1.3433 y(n-1) – 0.9025 y(n-2) + x(n) – 1.4142 x(n-1) + x(n-2)

Solution
The frequency response is

You might also like