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.

what can DFT(discrete fourier transform) be used for?

Status
Not open for further replies.

beargebinjie

Junior Member level 3
Junior Member level 3
Joined
May 4, 2005
Messages
27
Helped
0
Reputation
0
Reaction score
0
Trophy points
1,281
Activity points
1,521
hi, friends: i know that DFT is a approximation of the CFT or DTFT,.
but i cannot have direct connection between some other meanings and DFT process, such as every DFT bin is bandpass filter, and DFT processing gain and so on. is there anybody who understanding DFT well can explain it deeply.
thanks!
 

Here's my high level view of just the basics.

First, all these FT transforms are used to convert the time domain into the frequency domain. It's very important to understand this. There are reverse transforms for converting the frequency domain back to the time domain as well.

Signals in the time domain can be represented mathematically either as functions or discrete samples. For example a sinusoidal signal can be x = sin(wt) - a function. Or x(0) = 0, x(1) = .707, x(2) = 1.0, etc. - a set of discrete samples.

CFT
The 'C' here means continuous which means the signal is defined by a set of functions. If you want to use functions (eg. sin(wt)) then you need to use the continuous form of the FT (CFT). The result from the CFT is a set of functions representing the frequency spectrum. So basically, you input a continuous time signal and you get out a continuous frequency spectrum. What does this mean? It just means that you can determine the signal level at any time you choose - since its a function. It also means that you can determine the amplitude of any single frequency component - since its a function. This is the advantage of the CFT - it's exact and countinuous. The big disadvantage is that it's really hard to compute for arbitrary signals - virtually impossible sometimes.

DTFT
The 'D' here means discrete which means it is just a collection of data points.
Discrete transforms are appoximations since you only know the value at a discrete time or frequency.
For a discrete signal, there are no functions describing the input, just a bunch of data. These data points can be periodic or not. If they are periodic (sampled) then the DTFT becomes the DFT. So in this case, you input an array of data points representing time and you get out an array of data points representing frequency. The term 'bins' is typically used to describe these data points. What this means is that a single frequency data point represents a frequency band or bin. So for example, if f(3) = 0.5 and the bins are 1 kHz wide, then the relative power of all the frequencies in the bin is 0.5. If you add up all the bins the total will be 1.0 (normalized & adjusted for phase). You can control the number of bins and their bandwidth by setting the sample frequency and the number of samples you process. As the sample frequency and number of samples increases, the number of bins increases and the bandwith decreases - meaning it is more accurate.
The frequency bins can be thought of as bandpass filters with amplitude detectors.
In practice DFT's are often used to detect a single band of frequencies. In this case the math is faster since you only have to calculate values for one bin.
However to say that it is a bandpass filter is incorrect since the output is the frequency domain. If you need to know the power in a band this it works just fine - for example if you wanted to detect DTMF tones. But in order to make a bp filter you would have to run an IDFT on the band to get back to the time domain and then if you wanted an analog signal you could use a DAC. In practice you have to understand and tune all the aspects of the conversions if you want a useable output.


Hope this helps.
 
Thanks a lot for newelltech's long reply, and it does help me!

But i still have some confuse about SNR calculation of a noise signal, such as a sinewave plus a random noise. if the FFT result is normalized to the signal bin's magnitude, then more FFT data will get lower rms noise level.

noise's power in the DFT is the sum of the all bins, so is that mean more FFT bins more noise power??

or because lower noise level then the noise ppower will keep constant, it is just my guess.

could you please explain some aspect about SNR computation with FFT?
thanks!
 

i have comfirmed that the total noise power keep constant when the FFT data number is increase.

i am designing a sigma-delta ADC, it need to analysis the modulator output spectrum with FFT, so if somebody familiar with niose spectrum analysis, hope can share your expeirence, thanks!
 

Status
Not open for further replies.

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top