Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Cooley-Tukey-based fast Fourier transform (FFT) algorithm

An algorithm and twiddle factor technology, applied in calculation, complex mathematical operations, special data processing applications, etc., can solve problems such as slow dynamic response speed, long calculation delay, and low calculation accuracy, so as to reduce the number of multiplications and solve the problem of occupying The effect of large amounts of RAM space

Inactive Publication Date: 2016-08-24
NANJING APAITEK TECH
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The technical problem to be solved by the present invention is that the existing FFT algorithm has long calculation delay, slow dynamic response speed, low calculation accuracy, and occupies a large amount of RAM space

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Cooley-Tukey-based fast Fourier transform (FFT) algorithm
  • Cooley-Tukey-based fast Fourier transform (FFT) algorithm
  • Cooley-Tukey-based fast Fourier transform (FFT) algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0015] The present invention will be further described below in conjunction with the accompanying drawings.

[0016] In the traditional FFT method, the number of complex multiplications of N-point FFT is equal to N 2 , the amount of calculation is too large, the calculation delay is long, and the dynamic response speed is slow; using the Cooley-Tukey FFT algorithm, decomposing the N-point FFT into several shorter sequence FFTs can greatly reduce the number of multiplications, for example, the N-point The FFT breaks down into two Point FFT, then the number of multiplications will be reduced to

[0017] Here, the two-dimensional Cooley-Tukey fast algorithm assuming N=r1*r2 is used to explain the Cooley-Tukey fast algorithm, which is divided into five steps:

[0018] a. Rewrite x(n) into x(n1,n0), using

[0019] x(n)=x(r 2 no 1 +n 0 )=x(n 1 ,n 0 ),

[0020] b. Do r2 FFTs of r1 points to get X1(k0,n0).

[0021] X 1 ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a Cooley-Tukey-based fast Fourier transform (FFT) algorithm. The Cooley-Tukey-based FFT algorithm utilizes a field programmable gate array (FPGA) chip and adopts Radix-4 dish operation to decompose N-point FFT into one or more short sequence FFTs. The Cooley-Tukey-based FFT algorithm decomposes the N-point FFT into the several short sequence FFTs, thus greatly reducing times of complex multiplication; by adopting the Radix-4 dish operation, the Cooley-Tukey-based FFT algorithm solves the problems of long computation delay and slow dynamic response speed; furthermore, the Cooley-Tukey-based FFT algorithm is realized by utilizing the rich logical resources of FPGA, thus solving the problem of occupying a large space of a random-access memory (RAM).

Description

technical field [0001] The invention relates to the field of harmonic detection in electric power systems, in particular to a Cooley-Tukey-based FFT algorithm realized by an FPGA chip. Background technique [0002] The FFT algorithm is widely used in the field of harmonic current detection in power systems. The previous harmonic current detection method used the DSP chip to detect harmonic current using the traditional FFT algorithm, but the traditional method has long calculation delays, slow dynamic response speed, and high calculation accuracy. Problems that are not high and take up a lot of RAM space. Contents of the invention [0003] The technical problem to be solved by the present invention is that the existing FFT algorithm has long calculation delay, slow dynamic response speed, low calculation precision and occupies a large amount of RAM space. [0004] For solving the problems of the technologies described above, the technical scheme that the present invention...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/14
CPCG06F17/142
Inventor 刘明仇志凌张明葛文海
Owner NANJING APAITEK TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com