[SOLVED] mathematical complexities in DFT

Status
Not open for further replies.

KhaledOsmani

Full Member level 6
Joined
May 4, 2014
Messages
384
Helped
1
Reputation
2
Reaction score
1
Trophy points
18
Visit site
Activity points
3,933
Hello,

Concerning the discrete fourier transform, in digital signal processing domain:

if you have a signal, labeled as x, such that x = {-1, -2, 1, 2} which is the input signal of a discrete time filter.

HOW The following result has taken place:

- - - Updated - - -

(The solution is in red)
 

Attachments

  • dft.jpg
    27.1 KB · Views: 128

Status
Not open for further replies.

Similar threads

Cookies are required to use this site. You must accept them to continue using the site. Learn more…