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.

fourier transform methods

Status
Not open for further replies.

GoRub

Junior Member level 3
Joined
Sep 24, 2011
Messages
27
Helped
0
Reputation
0
Reaction score
0
Trophy points
1,281
Activity points
1,548
I search after information like sites or Tabels that compare with diffrent methods or documents that have explanation about the different in all fourier transform methods like DFT, FFT, DTFT, Fourier queue and more
 

anyone ???
 

Sometimes your question may not clear.
 

dtft -- given all points, determine a spectrum.
dft -- given a set of points, determine the same number of points from the spectrum.
fft -- same. the fft is just any fast calculation method. FFT is often used interchangeably with "DFT" as a term.

There are two immediate implications above. The first is that the DFT/FFT on N points in time will give ONLY N points on the spectrum. Any waveform that doesn't exactly repeat within the N points will not fall on one of the N spectral points. The result is that one or two of these points will have high coefficients, with several others will have small values.

The second occurs when a signal has more than N points. multiple FFT's can be taken with different amounts of overlap (or none at all). This creates a time-frequency transform -- frequency content can now be said to change over time. However, the above commentary still stands.
 

Status
Not open for further replies.

Similar threads

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top