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

FFT (fast Fourier transform) method based on point-by-point sequential step-by-step processing flow

A processing flow and sequential technology, applied in the field of FFT method research, achieves the effect of engineering realizability and improving real-time performance

Active Publication Date: 2016-02-17
SHANGHAI RADIO EQUIP RES INST
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] The purpose of the present invention is to solve the problem of the integrity of the input sequence required by the FFT operation through a kind of FFT method based on point-by-point sequential step-by-step processing flow

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
  • FFT (fast Fourier transform) method based on point-by-point sequential step-by-step processing flow
  • FFT (fast Fourier transform) method based on point-by-point sequential step-by-step processing flow
  • FFT (fast Fourier transform) method based on point-by-point sequential step-by-step processing flow

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0031] The FFT method based on the point-by-point sequential and step-by-step processing flow utilizes the linearity of FFT to realize transform processing. The linear nature of the FFT is described as follows:

[0032] If there is a sequence of N points x(n)=[x(1)x(2)x(3)...x(N)], let x 1 (n)=[x(1)00...0], x 2 (n)=[0x(2)0...0], x 3 (n)=[00x(3)...0],...,x N (n)=[000...x(N)], then the following formula is satisfied:

[0033] FFT(x(n),N)=FFT(x 1 (n),N)+FFT(x 2 (n),N)+…+FFT(x N (n), N)

[0034] In the formula, FFT(x(n), N) refers to performing N-point FFT operation on the x(n) sequence.

[0035] It can be seen that the overall FFT transformation of the sequence x(n) can be equivalent to N simple sequences x 1 (n)~x N The sum of the FFT transformation of (n), that is, the FFT has a linear characteristic. Based on the above characteristics, point-by-point sequential and step-by-step FFT processing can be realized: when x(1) enters the sequence x(n), FFT(x 1 (n), N) oper...

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 provides an FFT (fast Fourier transform) method based on point-by-point sequential step-by-step processing flow. The FFT method comprises the following steps: utilizing linear properties of the FFT to realize point-by-point sequential step-by-step processing; splitting N-point FFT into the addition of N FFTs with simple sequences; utilizing table lookup to reduce transformation time of the FFTs with simple sequences; finally, improving transform efficiency of the whole sequence. The method can pre-process first-in data in advance under the condition that a to-be-transformed sequence is incomplete, and the FFT transform results can be output after the sequence is complete. According to the method, the integral processing time of FFT is fragmented, and time of a preparation process of data is sufficiently utilized to complete transform work, so that the FFT method is especially suitable for a radar signal processing system of a pipeline processing structure.

Description

technical field [0001] The invention relates to the research field of FFT (Fast Fourier Transformation, Fast Fourier Transform) method, in particular to an FFT method based on a point-by-point sequential and step-by-step processing flow, which can be applied to a radar signal processing system. Background technique [0002] FFT is a fast algorithm of discrete Fourier transform, which can realize fast conversion of signal sequence between time domain and frequency domain. The FFT algorithm is obtained by improving the transform algorithm according to the odd, even, imaginary and real characteristics of discrete Fourier transform. It has no new discoveries in the theory of discrete Fourier transform, but in systems that use binary processors, such as computer systems or digital signal processing systems, the algorithm can quickly obtain the desired results. FFT algorithm has a wide range of applications in radar signal processing, such as: echo time-frequency domain conversio...

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 SHANGHAI RADIO EQUIP RES INST
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