Scribd
Upload
76 views15 pages

Lecture 06-07

The document discusses the discrete Fourier transform (DFT). Specifically: 1) The DFT provides uniformly spaced samples of the discrete-time Fourier transform and can be calculated using a matrix equation. 2) Given an N-point vector of a signal sequence, the DFT yields an N-point vector of frequency samples. 3) Examples are provided to demonstrate calculating the DFT and inverse DFT of different sequences using the matrix formulation.

Uploaded by

Muhammad Husnain
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
76 views15 pages

Lecture 06-07

The document discusses the discrete Fourier transform (DFT). Specifically: 1) The DFT provides uniformly spaced samples of the discrete-time Fourier transform and can be calculated using a matrix equation. 2) Given an N-point vector of a signal sequence, the DFT yields an N-point vector of frequency samples. 3) Examples are provided to demonstrate calculating the DFT and inverse DFT of different sequences using the matrix formulation.

Uploaded by

Muhammad Husnain
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/ 15

Digital Signal Processing (DSP)

Lecture 06
Discrete Fourier Transform (DFT)
(Matrix Calculation)

Digital Signal Processing, Lecture 06


Discrete Fourier Transform (DFT) Overview

The DFT provides uniformly spaced samples of the Discrete-Time


Fourier Transform (DTFT).

Discrete Fourier transform (DFT) of a discrete-time signal x[n] with


finite extent n  [0, N-1]
N 1 2nk N 1 2nk
j 1
X [k ]   x[n]e  X [k ]e
j
N
x[n]  N

n 0 N n 0
Twiddle factor:
Discrete Fourier Transform (DFT)
Overview
The Discrete Fourier Transform is a numerical variant of the Fourier Transform.
Specifically,
given a vector of n input amplitudes such as {f0, f1, f2, ... , fn-2, fn-1}, the Discrete
Fourier Transform yields a set of n frequency magnitudes.
The DFT is defined as such:

here, k is used to denote the frequency domain ordinal, and n is used to


represent the time-domain ordinal.
The big "N" is the length of the sequence to be transformed.
The Inverse DFT (IDFT) is given by the following equation:

Where is defined as:

Again, "N" is the length of the transformed sequence.


Discrete Fourier Transform (DFT)
Overview
The DFT can be calculated much more easily using a matrix
equation:
The little "x" is the time domain sequence arranged as a Nx1
vertical vector. The big "X" is the resulting frequency
information, that will be arranged as a vertical vector (as per the
rules of matrix multiplication. The "DN" term is a matrix defined as
such:

In a similar way, the IDFT can be calculated


using matrices as follows:

And we will define as the following:


Discrete Fourier Transform
Let N-point vector xN of the signal sequence x(n) , n = 0, 1, 2, ….(N-1)
and N-point vector XN of frequency samples and NxN matrix WN as
Discrete Fourier Transform
With these definitions, the N-point DFT
may be expressed in matrix form as,

The inverse DFT

Or

IN is an NxN identity matrix.


Discrete Fourier Transform
Example:
Compute the DFT of the 4-point sequence

then
More Examples
• Compute the DFT X(k) of the 4-point
sequence
x(n)= {1, 2, 0, 1}
x(n)={1,2,2,0}
More Examples
Compute the DFT X(k) of the 6-point
sequence
x(n)= {1, 2, 0, 1, 1, 2}
More Examples
X(k) = {6,-2+2j, 2, -2-2j}……x(n)= {0, 1, 2, 3}
More Examples

Compute IDTF of the


X(k) = {4,-2j, 2, 0, 2j}…………x(n)= {1, 2, 1, 0}
Discrete Fourier Transform (revision)
Example:
Determine Discrete Fourier Transform (DFT) of the following sequence:

x[n] = anU [n] a 1


 n  n
 j 2k  j 2k
x[k ]   x(nT )e N   a nU s (n)e N
n   n  

 n  2k
 j 2k j
x[k ]   a ne N   (ae N )n
n 0 n0

1
x[k ] 
2 k
j k = 0 , 1 , 2 , 3 , …..…, N-1
1  ae N
Discrete Fourier Transform (revision)
Example:
Determine Discrete Fourier Transform (DFT) of the following sequence:

x[n] = anU [n+3] a 1

 n  n
 j 2k  j 2k
x[k ]   x(nT )e N   a nU s (n  3)e N
n   n  

 n  2k 1 2k
 j 2k j j
x[k ]   a ne N   (ae N )n 
 (ae N )n
n 3 n0 n 3

a 3e j 6 k
x[k ]  2 k
j k = 0 , 1 , 2 , 3 , …………, N-1
1  ae N
Summary and Exercise
Summary
Discrete Fourier Transform
Matrix Calculation
Examples
 Next
Fast Fourier Transform
Exercise

Digital Signal Processing, Lecture 4, Spring


2014
Questions?

Digital Signal Processing, Lecture 06, Spring 2015

You might also like