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

Fast Fourier analysis algorithm

An analysis algorithm, Fourier transform technology, applied in the field of fast Fourier analysis algorithm, can solve problems such as slow calculation speed

Pending Publication Date: 2019-06-07
安徽慕京信息技术有限公司
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Afterwards, the Fourier transform is performed twice as many times as the previous analysis points until the N-point Fourier transform is independent of each other, which solves the problem of slow calculation speed of the existing Fourier transform

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
  • Fast Fourier analysis algorithm
  • Fast Fourier analysis algorithm
  • Fast Fourier analysis algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0119] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.

[0120] see figure 1 Shown, the present invention is a kind of fast Fourier analysis algorithm, comprises following process:

[0121] S00: Obtain the order sorting sequence x(n) of the input data of N sampling points;

[0122] Among them, n=0,1,2,...,N-1;

[0123] S01: First, calculate the basic sorting table G(m) according to the different analysis bases, and then pass y(n)=x(G(m)+2 Lmax-1 ×l) Calculate the reverse sequence y(n) of the input data;

[0124] Amon...

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 fast Fourier analysis algorithm, and relates to the technical field. The algorithm comprises the steps of obtaining a sequential sorting sequence x (n) of input data of N sampling points; calculating inverted sequence y(n) of input data by y(n)=x (G(m)+2Lmax-1*l); taking 8-point, 10-point or 12-point data from the inverted sequence y (n) for the first time for Fourier transform; amplifying the number of analysis points by two times each time to perform Fourier transform; and carrying out Fourier transform with mutually independent N points. According to the algorithm,the inverted sequence y (n) of input sequences by y(n)=x (G(m)+2Lmax-1*l) is calculated according to the difference between the total number of points participating in the sequence and the number ofpoints participating in the Fourier transform for the first time, and then the first-time 8-point, 10-point or 12-point data Fourier transform is rapidly completed through a set of formulas; the number of analysis points is amplified by two times each time to perform Fourier transform; according to the invention, the time complexity during calculation is reduced, the calculation rate is increased, and electric signal spectrum analysis is facilitated.

Description

technical field [0001] The invention belongs to the technical field of power signal analysis and processing, in particular to a fast Fourier analysis algorithm. Background technique [0002] The traditional FFT is to perform parity division on the input data sequence x(n) during the calculation process; the purpose of parity division is to achieve high-speed calculation, which originally needed to be calculated from 0 to N-1, and now only needs to be calculated from 0 to N after division / 2-1, and then merge again. After the first division to obtain the even and odd columns, the even and odd columns in the even columns and the even and odd columns in the odd columns can also be divided, so that it can be divided until there are only two points. Fourier transform. [0003] In the analysis of power signals (voltage, current), first determine what kind of functional analysis (single-cycle analysis, inter-harmonic analysis or voltage fluctuation and flicker analysis) to perfor...

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
Inventor 汪洋王浩然吴硕
Owner 安徽慕京信息技术有限公司
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