You are on page 1of 10

SUBJECT

DIGITAL SIGNAL
PROCESSING (DSP)
LAB

Lab Report#05

Submitted By:

MUHAMMAD TALHA (UET-02)


ABDUL HASEEB ZULFIQAR (UET-18)
ZAIN UL ABIDEEN (UET-50)

Class: B.sc EE (18)

Submitted to:

Engr. Mazahir Hussain

Dated:

26/10/2021
Lab Title:

Frequency Analysis

Objectives:
In this lab we will study the frequency analysis of the system using MATLAB. The
objectives of this lab are:

1) To study the frequency analysis of the system


2) To study the properties of DTFT

Software:
 MATLAB 2013

Introduction:
In mathematics, the discrete-time Fourier transform (DTFT) is a form of Fourier
analysis that is applicable to a sequence of values.
The DTFT is often used to analyze samples of a continuous function. The term discrete-
time refers to the fact that the transform operates on discrete data, often samples whose
interval has units of time. From uniformly spaced samples it produces a function of frequency
that is a periodic summation of the continuous Fourier transform of the original continuous
function. Under certain theoretical conditions, described by the sampling theorem, the
original continuous function can be recovered perfectly from the DTFT and thus from the
original discrete samples.
The discrete-time Fourier transform of a discrete sequence of real or complex numbers x[n],
for all integers n, is a Fourier series, which produces a periodic function of a frequency
variable. When the frequency variable, ω, has normalized units of radians/sample, the
periodicity is 2π, and the Fourier series is:

An operation that recovers the discrete data sequence from the DTFT function is called
an inverse DTFT. For instance, the inverse continuous Fourier transform will be:
Fourier analysis of discrete systems described by difference equation provide the plots for the
following along with the title of each by matching its response to Low pass, high pass, band
pass or band stop filter. Also include in the title whether the system is FIR or IIR. The
frequency response can be obtained using freqz(num,den). Poles and zero plot is obtained
using zplane(num,den). Comment on the poles and zeros location of each filter.
a. Y[n] = 0.08x[n] + 0.34x[n-1] + 0.34x[n-2] + .34x[n-3] + 0.08x[n-4]

b. Y[n] – 1.11y[n-1] + 0.57 y[n-2] = x[n] + 2x[n-1] + x[n-2]


c. Y[n] = -0.21x[n] -0.17x[n-1] + 0.81x[n-2] -0.17x[n-3] -0.21x[n-4]
d. Y[n] – 1.11y[n-1] + 0.57y[n-2] = x[n] – 2x[n-1] + x[n-2]

e. Y[n] = -0.35x[n] + 0.2x[n-1] -0.07x[n-2] + 0.20x[n-3] – 0.35x[n-4]


f. 2y[n] + 1.63y[n-1] + 0.65y[n-2] = x[n] – x[n-2]
Properties of DTFT
In this part fft(x,n) function will be used to prove some of the Fourier transform properties
Linearity
The discrete-time Fourier transform is a linear transformation; that is,
b. Time shifting
A shift in the time domain corresponds to the phase shifting
Frequency shifting
Multiplication by a complex exponential corresponds to a shift in the frequency domain
Conclusion:
In this lab we studied about the frequency analysis of signal and their implementation in
MATLAB. We also studied about the properties of DTFT and their implementation in
MATLAB.

You might also like