Scribd
Upload
3K views2 pages

Examples On Radix-2 DIT-FFT Algorithm 1) Use The 8-Point Radix-2 DIT-FFT Algorithm To Find The DFT of The Sequence X (N) (0.707,1,0.707,0, - 0.707,-1,-0.707,-0)

This document provides two examples of using an 8-point Radix-2 DIT-FFT algorithm to find the discrete Fourier transform (DFT) of input sequences. The first example computes the DFT of the sequence {0.707, 1, 0.707, 0, -0.707, -1, -0.707, 0} and the second computes the DFT of the sequence {1, 1, 0, 0, -1, -1, 0, 0}.

Uploaded by

Puneet Bansal
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
3K views2 pages

Examples On Radix-2 DIT-FFT Algorithm 1) Use The 8-Point Radix-2 DIT-FFT Algorithm To Find The DFT of The Sequence X (N) (0.707,1,0.707,0, - 0.707,-1,-0.707,-0)

This document provides two examples of using an 8-point Radix-2 DIT-FFT algorithm to find the discrete Fourier transform (DFT) of input sequences. The first example computes the DFT of the sequence {0.707, 1, 0.707, 0, -0.707, -1, -0.707, 0} and the second computes the DFT of the sequence {1, 1, 0, 0, -1, -1, 0, 0}.

Uploaded by

Puneet Bansal
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/ 2

Examples on Radix-2 DIT-FFT Algorithm

1) Use the 8-point Radix-2 DIT-FFT Algorithm to find the DFT of the sequence
x(n)={0.707,1,0.707,0, -0.707,-1,-0.707,-0}
2) Use the 8-point Radix-2 DIT-FFT Algorithm to find the DFT of the sequence
x(n)={1,1,0,0,-1,-1,0,0}

You might also like