2560-point grouping 2-based rapid fast fourier transform method
A technology of Fourier transform and leaf transform, applied in the field of 2560-point grouping base 2 fast Fourier transform, which can solve problems such as unsatisfactory use needs, slow measurement and analysis speed of harmonics and interharmonics, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0029] Embodiments of the present invention are described in detail below:
[0030] There is a sampling time window, the number of data points is {x(n)}, n=0,1,2,3...,2559.
[0031] Then its DFT is:
[0032] X ( k ) = DFT [ x ( n ) ] = Σ n = 0 2559 x ( n ) W 2560 kn ;
[0033] in W N = e - j 2 π N , N=2560.
[0034] Set 0≤k≤511, divide {x(n)} into 5 groups {x(5r)}, {x(5r+1)}, {x(5r+2)}, ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 