I've been looking in all of my books, and cannot determine if there is
a standard for how many samples/what duration to take a Fourier
transform of, in order to represent a low frequency signal well. I
understand that in a pulse, or square wave, there are infinite
frequencies that can be generated, including 1Hz or lower, but I'm
under the impression currently, that a 1/4 second window would be
needed to determine that there is a 1Hz component with a relatively
generous magnitude.
What I'd like to know, is if what I'm asking is acutally an issue? A
signal in the frequency domain...well, a discrete signal processed
through a Fourier Transform, has a continuous frequency
spectrum...which would suggest to me that there is no issue with lower
frequency components in any window...or is there?
Please give me any feedback or experiences with this, I appreciate your
time.
|
|
0
|
|
|
|
Reply
|
henrybg (38)
|
4/22/2005 8:27:56 PM |
|
"Benry" <henrybg@gmail.com> wrote in message
news:1114201676.631192.201890@f14g2000cwb.googlegroups.com...
> I've been looking in all of my books, and cannot determine if there is
> a standard for how many samples/what duration to take a Fourier
> transform of, in order to represent a low frequency signal well. I
> understand that in a pulse, or square wave, there are infinite
> frequencies that can be generated, including 1Hz or lower, but I'm
> under the impression currently, that a 1/4 second window would be
> needed to determine that there is a 1Hz component with a relatively
> generous magnitude.
>
> What I'd like to know, is if what I'm asking is acutally an issue? A
> signal in the frequency domain...well, a discrete signal processed
> through a Fourier Transform, has a continuous frequency
> spectrum...which would suggest to me that there is no issue with lower
> frequency components in any window...or is there?
Most people usually apply the DFT (or FFT) to a discrete time signal in
which case you don't have a continuous frequency spectrum. A general rule of
thumb is you need to capture about 1 sec of data to see signals that are 1
Hz apart. This is a little different from just wanting to view a signal at
1Hz or lower. If you don't care about signals getting 'lumped' together or
if you know you only have 1 signal in the entire set of freqs from 0 - 100
Hz, then (in this case) you could get away with capturing only 10ms worth of
data before performing the DFT.
Cheers
Bhaskar
>
> Please give me any feedback or experiences with this, I appreciate your
> time.
>
|
|
0
|
|
|
|
Reply
|
bhaskart1 (258)
|
4/22/2005 8:36:28 PM
|
|
Benry wrote:
> I've been looking in all of my books, and cannot determine if there is
> a standard for how many samples/what duration to take a Fourier
> transform of, in order to represent a low frequency signal well. I
> understand that in a pulse, or square wave, there are infinite
> frequencies that can be generated, including 1Hz or lower, but I'm
> under the impression currently, that a 1/4 second window would be
> needed to determine that there is a 1Hz component with a relatively
> generous magnitude.
>
> What I'd like to know, is if what I'm asking is acutally an issue? A
> signal in the frequency domain...well, a discrete signal processed
> through a Fourier Transform, has a continuous frequency
> spectrum...which would suggest to me that there is no issue with lower
> frequency components in any window...or is there?
>
> Please give me any feedback or experiences with this, I appreciate your
> time.
Although the actual process is a bit more involved, the procedure is this:
Decide what the highest frequency of interest is.
Filter the signal to remove higher frequencies.
Sample the signal at a rate higher than the highest frequency remaining.
Collect twice as many samples as you want bins.
Modify their amplitudes with a window, i.e., Hamming.
Perform a discrete Fourier transform.
You now have one number per bin.
Jerry
--
Engineering is the art of making what you want from things you can get.
�����������������������������������������������������������������������
|
|
0
|
|
|
|
Reply
|
jya (12870)
|
4/23/2005 2:48:41 AM
|
|
perfect answer has been given by Mr Jerry.Follow that.
>Benry wrote:
>> I've been looking in all of my books, and cannot determine if there is
>> a standard for how many samples/what duration to take a Fourier
>> transform of, in order to represent a low frequency signal well. I
>> understand that in a pulse, or square wave, there are infinite
>> frequencies that can be generated, including 1Hz or lower, but I'm
>> under the impression currently, that a 1/4 second window would be
>> needed to determine that there is a 1Hz component with a relatively
>> generous magnitude.
>>
>> What I'd like to know, is if what I'm asking is acutally an issue? A
>> signal in the frequency domain...well, a discrete signal processed
>> through a Fourier Transform, has a continuous frequency
>> spectrum...which would suggest to me that there is no issue with lower
>> frequency components in any window...or is there?
>>
>> Please give me any feedback or experiences with this, I appreciat
your
>> time.
>
>Although the actual process is a bit more involved, the procedure i
this:
>
>Decide what the highest frequency of interest is.
>
>Filter the signal to remove higher frequencies.
>
>Sample the signal at a rate higher than the highest frequency remaining.
>
>Collect twice as many samples as you want bins.
>
>Modify their amplitudes with a window, i.e., Hamming.
>
>Perform a discrete Fourier transform.
>
>You now have one number per bin.
>
>Jerry
>--
>Engineering is the art of making what you want from things you can get.
>�����������������������������������������������������������������������
>
This message was sent using the Comp.DSP web interface o
www.DSPRelated.com
|
|
0
|
|
|
|
Reply
|
shikhadrdo (4)
|
4/23/2005 10:15:41 AM
|
|
Sometimes the fingers lag behind the mind.
I wrote:
> Sample the signal at a rate higher than the highest frequency remaining.
True, but only by nitpicking; it's not what I meant. Sample the signal
at a rate higher than _twice_ the highest frequency remaining.
Jerry
--
Engineering is the art of making what you want from things you can get.
�����������������������������������������������������������������������
|
|
0
|
|
|
|
Reply
|
jya (12870)
|
4/23/2005 2:08:55 PM
|
|
|
4 Replies
38 Views
(page loaded in 0.785 seconds)
Similiar Articles: Spectrum analysis (FFT) of partial waves / scilab - comp.dsp ...If FFT is the only way to go, however, perhaps there are other settings ... do with estimating a low frequency signal of very ... The Fast Fourier Transform (FFT) and the ... Signal-to-noise ratio for a sine signal?? - comp.soft-sys.matlab ...We've all heard of cases where the SNR is very low ... > But with FFT method, I always get a negative ... Most of the time there is a measurement window consisting of 1. Frequency Resolution of the DFT - comp.dspThe standard forumulas assume a single sinusoid ... at any frequencies between the Fourier frequencies. There ... FFT size is 8192, window size is 8192 and quantizer resolution ... Calculate FFT in blocks and then average it. - comp.dspHi guys, I have a very basic problem. I am able to calculate FFT of an ... I have seen moving average, low-pass FFT ... of vector x, computed with a fast Fourier transform ... conventional wisdom how to upsample very large arrays, accurately ...... are *VERY* low ... There are obviously a lot of tradeoffs in selecting a method. >I'm assuming that the initial FFT samples, X(m), are *VERY* >low in ... time window ... why first order filter have slope 6db/octave - comp.dspWith constant excitation: At very low frequencies, the capacitor ... ripple factor in the literature even though there ... Time-Domain, FFT, and Octave (and 1/3 Octave) band ... AM digital demodulation methods - comp.dspIs there a standard way. I'm not yet looking for complicated ... of 5kHz, and presumably set such that image frequencies ... an AM radio, and I'm mostly interested in very low ... periodic noise removal - comp.soft-sys.matlabIf I look at the FFT of either image, it's very difficult to ... is, is there a good i.e. been there, done that, way to find this very ... comp.soft ..... the window ... Sliding Goertzel of Jacobsen&Lions correct? - comp.dsp... because the way it appeared in EDN wasn't really very ... all agree that the Sliding Goertzel >(unlike the standard ... one than spans the time extent of the transform window ... Bessel Filter (Digital) - comp.dspUnless you've got both a) a very low cutoff frequency ... There are FFT implementations that do block floating point ... Is 'Bessel' digital lowpass filter standard? - comp.dsp ... audio - Lower frequencies stronger in FFT? - Signal Processing ...... going to make a difference on the low frequencies ... since this is the width of the FFT being applied. This window ... Fast Fourier transform- non-integer number of cycles in ... FFT window - katjaashomeSome windows are designed to have a fairly flat and low ... FFT, the window is modulated by the input frequencies, or ... seen very few comments on this. Of course, if there ... 7/23/2012 2:56:29 AM
|