Compute DFT of sequence $x(n) = \{1, 2, 2, 2, 1, 0, 0, 0\}$ using DIT-FFT algorithm.

6.3kviews

Compute DFT of sequence

$x(n) = \{1, 2, 2, 2, 1, 0, 0, 0\}$ using DIT-FFT algorithm.

written 8.6 years ago by

teamques10 ★ 69k

modified 3.2 years ago by

sagarkolekar ★ 11k

discrete time signal processing

ADD COMMENT EDIT

1 Answer

219views

written 8.6 years ago by

teamques10 ★ 69k

By signal flow graph of 8 point DIT – FFT, Output stage I :-

$g (0) = x (0) + x (4) = 1 + 1 = 2 \\ g (1) = x (1) + x (5) = 2 + 0 = 2 \\ g (2) = x (2) + …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.