Results 1 to 9 of 9
Hybrid View
-
21st September 2011 06:24 #1
, fft. , ....
Python Numpy:
>>>fft([1])
array([ 1.+0.j ])
>>>fft([1, 1])
array([ 2.+0.j, 0.+0.j ])
>>>fft([1, 2])
array([ 3.+0.j, -1.+0.j ])
>>>fft([1, 2, 2, 5])
array([ 10.+0.j, -1.+3.j, -4.+0.j, -1.-3.j ])
-
21st September 2011 08:27 #2Registered User
Join Date: Oct:2003
Location:
Posts: 4,317
http://en.wikipedia.org/wiki/Discret...orm#Definition :
"Definition
The sequence of N complex numbers x0, ..., xN−1 is transformed into another sequence of N complex numbers according to the DFT formula:"
-
21st September 2011 09:51 #3Registered User
Join Date: Jan:2005
Location: BG
Posts: 4,903
? FFT ... ... , ?
, , ... ...
-
21st September 2011 13:39 #4
-
22nd September 2011 01:58 #5Registered User
Join Date: Jan:2005
Location: BG
Posts: 4,903
, 4 , ,
(. http://docs.scipy.org/doc/numpy/refe...#numpy.fft.fft , -
)
( ) - - - , fft ., , ... ...
-
22nd September 2011 07:43 #6
FFT (time domain) (frequency domain). , . = index*sampleRate/FFTPoints, sqrt(re*re+im*im), atan(im/re).
rfft..




Reply With Quote
Lenovo ThinkPad 15 IdeaPad 15
5th May 2023, 22:16 in