Compule DFT of $x(n)=\{12345678\}$ using DIT-FFT algo.

1.7kviews

Compule DFT of

$x(n)=\{12345678\}$ using DIT-FFT algo.

written 5.6 years ago by

teamques10 ★ 69k

modified 3.0 years ago by

pedsangini276 • 4.8k

discrete time signal processing

ADD COMMENT EDIT

1 Answer

66views

written 5.6 years ago by

teamques10 ★ 69k

• modified 5.6 years ago

Given: $x(n)=\{12345678\}$

enter image description here

$x(k)=\left\{\begin{array}{c}{36,-4+9 \cdot 656 j,-4-4 j,-4+1 \cdot 656 j,-4} \\ {-4-1 \cdot 656 j,-4-4 j,-4-9 \cdot 656 j\}}\end{array}\right.$

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.