Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

[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
Activity points
3,933
Hello,

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

if you have a signal, labeled as x(n), such that x(n) = {-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
    dft.jpg
    27.1 KB · Views: 96

What kind of discrete filter it is?
in the solution you have performed circular shift operation not dft.
 
Status
Not open for further replies.

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top