Scribd
Upload
0 views

Tutorial_Lesson 4

The document is a tutorial for the BEE4013/EE414 Digital Signal Processing course, focusing on the Fast Fourier Transform (FFT). It includes a series of exercises that require evaluating the Discrete Fourier Transform (DFT) and its inverse using both decimation-in-frequency and decimation-in-time methods for given sequences. The tutorial emphasizes the calculation of complex multiplications involved in the FFT process.

Uploaded by

zaidzaidanz2001
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0 views

Tutorial_Lesson 4

The document is a tutorial for the BEE4013/EE414 Digital Signal Processing course, focusing on the Fast Fourier Transform (FFT). It includes a series of exercises that require evaluating the Discrete Fourier Transform (DFT) and its inverse using both decimation-in-frequency and decimation-in-time methods for given sequences. The tutorial emphasizes the calculation of complex multiplications involved in the FFT process.

Uploaded by

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

BEE4013/EE414 Digital Signal Processing

Tutorial
__________________________________________________________________________________________________
Lesson 4
Fast Fourier Transform (FFT)
1. Given a sequence x(n) for 0 ≤ n ≤ 3, where x(0) = 4, x(1) = 3, x(2) = 2, and x(3) = 1, evaluate its DFT
X(k) using the decimation-in-frequency FFT method, and determine the number of complex
multiplications.

2. Given the DFT sequence X(k) for 0 ≤ k ≤ 3 obtained in Question (1), evaluate its inverse DFT x(n)
using the decimation-in-frequency FFT method.

3. Given a sequence x(n) for 0 ≤ n ≤ 3, where x(0) = 0.8, x(1) = 0.6, x(2) = 0.4, and x(3) = 0.2, evaluate
its DFT X(k) using the decimation-in-frequency FFT method, and determine the number of
complex multiplications.

4. Given the DFT sequence X(k) for 0 ≤ k ≤ 3 obtained in Question (3), evaluate its inverse DFT x(n)
using the decimation-in-frequency FFT method.

5. Repeat Question (1) using decimation-in-time FFT method.

6. Repeat Question (2) using decimation-in-time FFT method.

You might also like