1/14/2022

DFT and DFT as Linear

Transformation
Lecture-25-26

This lecture covers

• Conventional method of computing Discrete Fourier Transform (DFT).
• Time Domain to Frequency Domain Conversion.
• Linear transformation / Matrix method of computing DFT.
• Computational requirements for DFT.

1
 1/14/2022

Discrete Fourier Transform

• DFT is a tool to transform signal representation to and from time and
frequency domains.
• x(n) is the time domain representation, while X(k) is the frequency
domain representation.
• Both x(n) and X(k) are signals of length ‘N’; i.e.
n= 0,1,2,…,N-1
and k= 0,1,2,…,N-1

Discrete Fourier Transform

• There are two equations used for DFT transformations:

2
 1/14/2022

Exercise
• Use DFT to compute DFT of the signal x(n) = {0,1,2,3}?

• Answer: X(k) = { 6, -2+2j, -2, -2-2j }

Frequency resolution

3
 1/14/2022

Spectral Spacing

Link between time and frequency variables

• t (sec) and n (t index),  tn = nTs

• k(freq index), F(Hz),  Fk = kΔF = kFs/N

• k(freq index), fd(cycles per sample)  fdk = k/N

• k(freq index), ωd (radians per sample)  ωdk = 2πk/N

4
 1/14/2022

Exercise
• What will be the spectral spacing when a 0.2 sec signal is sampled at
100 Hz?
• What will be required Fs, if the spectral spacing has to be 2Hz?

DFT as Linear Transformation

10

10

5
 1/14/2022

DFT as Linear Transformation

11

11

DFT as Linear Transformation

12

12

6
 1/14/2022

DFT as Linear Transformation

and …

13

13

DFT as Linear Transformation

14

14

7
 1/14/2022

DFT as Linear Transformation

15

15

DFT as Linear Transformation

16

16

8
 1/14/2022

Exercise
• Calculate W4 matrix.

17

17

Periodicity and Symmetry Property of WN

Periodicity Property: 𝑊 =𝑊

/
Symmetry Property: 𝑊 = −𝑊

18

18

9
 1/14/2022

Exercise

19

19

Computational Requirements of DFT

• Complex number Multiplications: N2
• Complex number Additions: N(N-1)

• Real number Multiplications Additions: 4N2

• Real number Additions: N(4N-2)

20

20

10
 1/14/2022

Exercise
• How many complex computations are required to run a 256 point
DFT?
• If the data is coming in at Fs = 2048 samples/sec, what will be the
minimum clock speed of the processor to run the DFTs in real time?

21

21

Reading
• Section 7.1.3 of Proakis

22

22

11