Scribd
Upload
19 views

Lab 10

DSP Lab

Uploaded by

mujtabajamal2004
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views

Lab 10

DSP Lab

Uploaded by

mujtabajamal2004
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Department of Computer Engineering

Digital Signal Processing

Course Instructor:

Lab Engineer:

Semester
LAB EXPERIMENT # 10
Frequency domain sampling: The Discrete Fourier Transform (DFT) using MATLAB

OBJECTIVES
The goal of this lab is to compute the DFT of finite length sequence using Fast Fourier Transform
(FFT) of N point sequence at L points. Also, compute the convolution of sequences using FFT.

In the case of a finite length sequence x[n], 0 ≤ 𝑛 ≤ 𝑁 − 1, there is a simpler relation between
DESCRIPTION

the sequence and its discrete time Fourier Transform (DTFT, 𝑋(𝑒𝑗𝑤)). In fact, a length-N sequence,
only N values of 𝑋(𝑒𝑗𝑤), called frequency samples at N distinct points, 𝜔 = 𝜔𝑘, 0 ≤ 𝑘 ≤ 𝑁 −
1, are sufficient to determine 𝑥[𝑛], and hence, 𝑋(𝑒𝑗𝑤), uniquely. This leads to the concepts of the
discrete Fourier transform, a second transform domain representation that is applicable to the finite
length sequence.

The simplest relation between a finite length sequence 𝑥[𝑛], defined for 0 ≤ 𝑛 ≤ 𝑁 − 1, and its
DTFT 𝑋(𝑒𝑗𝑤) is obtained by uniformly sampling 𝑋(𝑒𝑗𝑤) on the w-axis between 0 ≤ 𝜔 ≤ 2𝜋 at
𝜔𝑘 = 2
𝑁
𝜋𝑘
, for 0 ≤ 𝑘 ≤ 𝑁 − 1
𝑁−1
𝑗2𝜋𝑘𝑛

𝑋[𝑘] = 𝑋(𝑒 ) 2𝜋𝑘 = ∑ 𝑥[𝑛]𝑒


𝑗𝜔 −
𝑁 , 0≤𝑘≤𝑁−1
𝑤=
𝑁
𝑛=0

𝑋[𝑘] is also a finite length sequence in the frequency domain and is of length N. The sequence
𝑋[𝑘] is called the Discrete Fourier Transform (DFT) of the sequence x[n].
𝑁−1

𝑋[𝑘] = ∑ 𝑥[𝑛]𝑤𝑁𝑘𝑛, 0≤𝑘≤𝑁−1


𝑛=0

The inverse discrete Fourier Transform (IDFT) is given by

𝑥 ,
𝑘𝑛
0≤𝑛≤𝑁−1
𝑘=0
PRACTICE QUESTIONS

Q1. Compute the M-point DFT of the following N-point sequence.

1, 0≤𝑛≤𝑁−1
𝑢[𝑛] = {
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
Q2. Write a MATLAB program to compute the circular convolution of two length- N
sequences via DFT based approach. Using this program determine the circular convolution of
the following pairs of sequences.

a) 𝑔[𝑛] = {3 ,4 − 2 ,0 , 1 , −4} , ℎ[𝑛] = { 1, −3, 0, 4 , −2 , 3}


↑ ↑
b) 𝑥[𝑛] = sin 𝜋𝑛
, 𝑦[𝑛] = (𝑅𝑜𝑙𝑙 𝑁𝑢𝑚𝑏𝑒𝑟 − 𝐿𝑎𝑠𝑡 𝑇𝑤𝑜
𝐷𝑖𝑔𝑖𝑡𝑠)𝑛 0≤𝑛≤4 2
Rubrics:

Theoretical Setup Troubleshooting Completeness Total Aggregate


concepts preparation

You might also like