Scribd
Upload
2K views10 pages

PROBLEMS - DIT FFT Part 3

The document lists 7 problems involving computing discrete Fourier transforms (DFTs) of various sequences using a radix-2 discrete inverse transform - fast Fourier transform (DIT-FFT) algorithm. The sequences include {2,1,2,1,1,2,1,2}, {-1,2,2,2,-1}, {1,2,1}, {-1,1,-1,1}, (-1)n, and {1, -3 ≤ n ≤ 3}. It also provides the normal and bit-reversed order indexing for DIT-FFT and notes the answers are not shown.

Uploaded by

Abishek Rajesh
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
2K views10 pages

PROBLEMS - DIT FFT Part 3

The document lists 7 problems involving computing discrete Fourier transforms (DFTs) of various sequences using a radix-2 discrete inverse transform - fast Fourier transform (DIT-FFT) algorithm. The sequences include {2,1,2,1,1,2,1,2}, {-1,2,2,2,-1}, {1,2,1}, {-1,1,-1,1}, (-1)n, and {1, -3 ≤ n ≤ 3}. It also provides the normal and bit-reversed order indexing for DIT-FFT and notes the answers are not shown.

Uploaded by

Abishek Rajesh
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/ 10

PROBLEMS (From DIT-FFT)

1. Determine 8-point DFT of the sequence x(n) = { 2,1,2,1,1,2,1,2}


using Radix-2DIT-FFT approach
2. Determine the 8 point DFT of the sequence x(n) = {-1,2,2,2,-1} using Radix-2
DIT-FFT algorithm

N=8 , x(n) = {-1,2,2,2,-1,0,0,0}


3.Compute 4 Point DFT of the sequence x(n) = { 1,2,1) using Radix-2 DIT-FFT Algorithm

Normal order Bit reversed order

x(0) - x(00) x(00) - x(0)

x(1) - x(01) x(10) - x(2)

x(2) – x(10) x(01) - x(1)

x(3) – x(11) x(11) - x(3)


4.Determine the 8 point DFT of the sequence x(n) = {-1,1,-1,1 } using Radix-2 DIT-
FFT algorithm

N=8 , x(n) = {-1,1,-1,1,0,0,0,0 }

Ans:

5.

Ans:
6. Determine the 8 point DFT of the sequence x(n) = (-1)n using Radix-2
DIT-FFT algorithm

N=8 , n = 0-N-1 =0-7

x(n) = {1,-1,1,-1,1,-1,1,-1} (or) x(n) = {1,-1,1,-1,1,-1,1,-1}

7.Determine the 8 point DFT of the sequence x(n) = 1, -3 ≤ n ≤ 3 using


Radix-2 DIT-FFT algorithm

N=8 , n =0-N-1 = 0-7

x(n)= (1,1,1,1,1,1,1}

x(n) = {1,1,1,1,0,1,1,1}

You might also like