FFT (fast Fourier transform) butterfly operation hardware implementation circuit supporting complex multiplication
A butterfly operation and complex multiplication technology, applied in the field of FFT butterfly operation hardware implementation circuit, can solve the problems of high power consumption, short development time, difficult to meet DSP chips, etc., to reduce hardware overhead, reduce standardized operations, The effect of reducing the calculation delay
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0024] The present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments.
[0025] For large-scale FFT calculations, the Cooly-Tukey FFT algorithm is usually used. The Cooly-Tukey FFT algorithm adopts the idea of divide and conquer, and uses two-dimensional FFT simulation to realize a large-scale one-dimensional FFT (N). For N=N 1 *N 2 FFT of points can be done with N 2 N 1 Point and N 1 N 2 Point FFT algorithm to achieve, the iterative formula is as follows:
[0026] X [ k 1 N 2 + k 2 ] = Σ n 1 = 0 N 1 - 1 [ e ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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