Ask
Login
0
1.5kviews
Compule DFT of $x(n)=\{12345678\}$ using DIT-FFT algo.
written 4.6 years ago by gravatar for teamques10 teamques10 ★ 64k modified 2.0 years ago by gravatar for pedsangini276 pedsangini276 • 4.7k
discrete time signal processing
ADD COMMENT EDIT
1 Answer
0
61views
written 4.6 years ago by gravatar for teamques10 teamques10 ★ 64k •   modified 4.6 years ago

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

enter image description here

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.$
ADD COMMENT EDIT
Please log in to add an answer.