Method for realizing FFT (Fast Fourier Transform) with high point number

An implementation method and large-point technology, applied in the field of large-point FFT implementation, can solve the problem of occupying a large amount of time, and achieve the effect of shortening the conversion time

Inactive Publication Date: 2013-04-03
NO 54 INST OF CHINA ELECTRONICS SCI & TECH GRP
View PDF0 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In this way, in the large-point FFT transformation, the input and output wil

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
  • Method for realizing FFT (Fast Fourier Transform) with high point number
  • Method for realizing FFT (Fast Fourier Transform) with high point number
  • Method for realizing FFT (Fast Fourier Transform) with high point number

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0021] The present invention provides a method for implementing large-point FFT, such as figure 1 Shown. Take a 65536-point FFT with radix-16 as an example.

[0022] ① Load Nn point data of a group of data into the memory, N is the total number of FFT points of a group of data operations, n is the last loaded data in a group of data, the value of the number of points n is N / x, and x is the butterfly Base of shape operation;

[0023] In the example, N is 65536, x is 16, n is 4096, step ① loads 61440 points of data to the memory.

[0024] ②The last n points of data loaded in a group of data are directly sent to the butterfly operation unit, and the stored data in the memory is read at the same time, and the first-level butterfly operation is performed. After the operation, the first-level butterfly operation is performed. The calculation result is stored back to the memory;

[0025] In the example, the input part is combined with the first-level butterfly calculation as figure 2 As s...

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 method for realizing FFT (Fast Fourier Transform) with high point number, which is applicable to high-point number FFT circuit adopting fast continuous operation. The method comprises the steps of: according to the operation characteristics of the FFT, completing a first-stage butterfly operation simultaneously at the later stage of loading data, outputting data while conducting a last-stage butterfly operation, merging two stages of operation of the data for loading and outputting so as to shorten the operation time of each group of data; and writing a second group of data into the same storage while conducting inverted sequence output to the first group of data, and so on, cycling using a double-port storage to realize continuous operation. By applying the method, the advantages that the circuit area can be effectively reduced, and the operation speed can be increased are achieved. The method is applicable to high-point number FFT circuits requiring fast continuous operation.

Description

technical field [0001] The invention relates to the FFT technology for time-frequency conversion in the communication field. Background technique [0002] As the basic operation of time domain and frequency domain conversion, fast Fourier transform is a necessary prerequisite for spectrum analysis. It has a wide range of digital signal processing fields such as digital communication, voice signal analysis, image processing, radar, earthquake, and biomedical engineering. Applications. [0003] The traditional FFT (Fourier transform) transformation is divided into three stages. First, all the input data is stored in RAM, and then the butterfly operation is performed at all levels. After the butterfly operation is completed, the data is output from the RAM. The time required for the data is (loading time + computing time + output time). In this way, in the large-point FFT transformation, the input and output will take a lot of time, and the arithmetic unit is in an idle state...

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
IPC IPC(8): G06F17/14
Inventor 张勇孙雪晶常迎辉曹纯杜克明
Owner NO 54 INST OF CHINA ELECTRONICS SCI & TECH GRP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap