Supercharge Your Innovation With Domain-Expert AI Agents!

Asynchronous fast fourier transformation processor circuit

A Fourier transform and asynchronous technology, applied in the electronic field, can solve problems such as energy consumption and heavy clock tree load

Inactive Publication Date: 2007-03-21
INST OF MICROELECTRONICS CHINESE ACAD OF SCI
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] In the current implementation of synchronous circuits of fast Fourier transform, there are many inherent shortcomings of synchronous integrated circuits, such as relatively large clock tree load, unnecessary energy consumption in standby mode, etc.

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
  • Asynchronous fast fourier transformation processor circuit
  • Asynchronous fast fourier transformation processor circuit
  • Asynchronous fast fourier transformation processor circuit

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0019] The structure of the asynchronous fast Fourier transform processor is shown in Figure 1. The entire asynchronous fast Fourier transform processor circuit consists of an input storage unit 1, an input control unit 2, an asynchronous butterfly calculation array 3, an output storage unit 4 and an output control unit 5. The input data terminal is connected to the input storage unit 1 , and the input control unit 2 controls the input storage unit 1 and transmits the data to be processed to the asynchronous butterfly calculation array 3 in sequence.

[0020] The asynchronous butterfly calculation array 3 starts to work under the control of the request signal. After a series of butterfly calculations, the fast Fourier transform is completed, the calculation result is output to the output storage unit 5, and a completion signal is generated at the same time as the entire asynchronous fast Fourier transform processor. completion signal.

[0021] The output storage unit 5 sequent...

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

One asynchronous fast Fourier transform processor circuit relates to input location, input controlling unit, asynchronous arithmetic in butterfly and array, export location and export controlling unit. The input data connect into input location controlled by input controlling unit and storage the data. The asynchronous arithmetic in butterfly and array incepts data form input location and carries through a series of operation to complete Fourier transform. The request signal is the startup signal of asynchronous arithmetic in butterfly and array to produce one finished signal after finishing the whole fast Fourier transform. The export location incepts the data form the asynchronous arithmetic in butterfly and array. The export controlling unit controls export location and outputs ultimately result.

Description

technical field [0001] The invention relates to the field of electronics, in particular to the structure and realization of an asynchronous fast Fourier transform processor circuit. Background technique [0002] In 1965, Cooley-Tukey published a paper on fast Fourier transform, and the development of fast Fourier transform has a history of more than 30 years. [0003] Fast Fourier transform is a fast algorithm of discrete Fourier transform. It is a recursive decomposition algorithm. There are two main directions in the development of more than 30 years: one is the algorithm for the integer power of N equal to 2, such as the base 2 algorithm , radix-4 algorithm, radix-8 algorithm, real factor algorithm and split-radix algorithm, etc. The other is an algorithm in which N is not equal to an integer power of 2, which is a class of algorithms represented by Winograd (prime factor algorithm, Winograd algorithm). [0004] Fast Fourier transform is an important analysis tool in th...

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 INST OF MICROELECTRONICS CHINESE ACAD OF SCI
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

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