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

Realizing method and device of fast Fourier transform

A Fourier transform and implementation method technology, applied in the field of fast Fourier transform implementation methods and devices, can solve the problems of no data overflow control, inability to ensure that FFT calculation does not overflow, etc., to reduce the use of circuit resources, improve the pass rate, reduce cost effect

Active Publication Date: 2009-10-07
SANECHIPS TECH CO LTD
View PDF4 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] It can be seen from the above that in the process of the existing block floating-point FFT operation, there is no overflow control on the data, and it cannot guarantee that the FFT calculation will not overflow

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
  • Realizing method and device of fast Fourier transform
  • Realizing method and device of fast Fourier transform
  • Realizing method and device of fast Fourier transform

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0029] The present invention will be described in detail below with reference to the accompanying drawings.

[0030] method embodiment

[0031] According to an embodiment of the present invention, a fast Fourier transform implementation method is provided, which is used for performing Fourier transform after performing overflow control on received data. This method can decompose a DFT with a large number of points into a combination of DFTs with a small number of points, so that the entire DFT calculation process becomes a series of iterative operations.

[0032] figure 2 is a flow chart of a fast Fourier transform implementation method according to an embodiment of the present invention, such as figure 2 As shown, the method includes the following steps:

[0033] Step S202, dividing the predetermined interval into a plurality of sub-intervals according to the order of the received data;

[0034] Step S204, obtain the shift value of each data in the received data, and ob...

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 a realizing method of fast Fourier transform, which is used for controlling the overflow of received data and then carrying out the Fourier transform. The realizing method of the fast Fourier transform comprises the following steps: dividing a predetermined area into a plurality of sub-areas according to the exponent number of received data; obtaining a shifting value of each datum of the received data and also obtaining a shifting value with a maximal absolute value from the obtained shifting values; utilizing the shifting value with the maximal absolute value to respectively modify each datum and obtaining new modified data corresponding to each datum; and carrying out the fast Fourier transform for the new data, wherein the shifting values express the position relation of the sub-area where the data locating relative to a pointed sub-area of the sub-areas. Besides, the invention also provides a realizing device of the fast Fourier transform. The invention can ensure the calculation precision under the precondition of overflow control and can also reduce the utilization of circuit resources, lower the circuit cost and enhance the qualification rate of circuits.

Description

technical field [0001] The present invention relates to the field of communications, and more specifically, to a fast Fourier transform implementation method and device. Background technique [0002] Fast Fourier Transform (FFT for short) is a fast algorithm of Discrete Fourier Transform (DFT for short). It has an important position and wide application in the field of digital signal processing. Great transformation tool for images and more. [0003] At present, the main methods of FFT are radix 2, radix 4, radix 8, radix 16, etc. When the length of the transformation interval of DFT is relatively large, FFT is generally used to decompose DFT into radix 4, radix 2, radix 8 or radix 16. Decomposing the long-sequence DFT into short-sequence DFT can greatly improve the operation speed of DFT and increase the operation efficiency of DET by 1 to 2 orders of magnitude. [0004] Among them, the radix-2 and radix-4 FFT algorithms are relatively simple, easy to implement, and consu...

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 SANECHIPS TECH CO LTD
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