Dividing fourier transform by factor n

3 次查看（过去 30 天）
Sepp
Sepp 2017-11-12
评论： Star Strider 2017-11-12
Hello everybody
I have a problem with the fast fourier transform. I would like to extract the low and high frequency power of a signal. I have seen the following example (actually it is Python):
Y = np.fft.fft(signal)/n #Calculate FFT
Y = Y[range(n/2)] #Return one side of the FFT
lf = np.trapz(abs(Y[(frq>=0.04) & (frq<=0.15)]))
hf = np.trapz(abs(Y[(frq>=0.16) & (frq<=0.5)])) #Do the same for 0.16-0.5Hz (HF)
signal is just a an array of values (Let's say 10000 values).
The problem here is that I don't see what n should be. Should n just be the length of signal?

请先登录，再回答此问题。

采纳的回答

Star Strider
Star Strider 2017-11-12
‘Should n just be the length of signal?’
Yes. (Note that it is the length of the original signal, not of a signal zero-padded to have a length of a power-of-2.)
  2 个评论
Sepp
Sepp 2017-11-12
What do you mean with zero-padded?
Star Strider
Star Strider 2017-11-12
Zero-padding a vector to create an ‘augmented’ vector of length equal to the next highest power of 2 is sometimes desired because (1) it increases the efficiency of the fft calculation, and (2) increases the frequency resolution of the transformed vector.
The point is that all the energy in the vector are in the first ‘n’ samples, and that is the correct normalising value.

请先登录，再进行评论。

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Fourier Analysis and Filtering 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by