High-Performance Implementation and Optimization of Cooley-Tukey FFT Algorithm
The fast Fourier transform (FFT) algorithm is considered as an important element of the processor’s basic software ecology, and it is widely applied in the field of engineering, science, physics and mathematics. Meanwhile, the requirements for the performance of FFT in these applications...
Main Author: | GUO Jinxin, ZHANG Guangting, ZHANG Yunquan, CHEN Zehua, JIA Haipeng |
---|---|
Format: | Article |
Language: | zho |
Published: |
Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press
2022-06-01
|
Series: | Jisuanji kexue yu tansuo |
Subjects: | |
Online Access: | http://fcst.ceaj.org/fileup/1673-9418/PDF/2011092.pdf |
Similar Items
-
A RADIX-4/8/SPLIT RADIX FFT WITH REDUCED ARITHMETIC COMPLEXITY ALGORITHM
by: Shaik Qadeer, et al.
Published: (2012-03-01) -
Area-Efficient FFT Kernel with Improved Use of GI for Multistandard MIMO-OFDM Applications
by: Song-Nien Tang, et al.
Published: (2019-07-01) -
A transformada de Fourier em basic The Fourier transform (FFT) in basic
by: Mauricio Gomes Constantino, et al.
Published: (2000-06-01) -
FFT-Based Methods for Computational Contact Mechanics
by: Q. Jane Wang, et al.
Published: (2020-08-01) -
An IE-FFT Algorithm to Analyze PEC Objects for MFIE Formulation
by: Seung Mo Seo
Published: (2019-01-01)