Prime-factor FFT algorithm

About: Prime-factor FFT algorithm is a research topic. Over the lifetime, 2346 publications have been published within this topic receiving 65147 citations. The topic is also known as: Prime Factor Algorithm.

Hardware efficient fast computation of the discrete fourier transform

Abstract: In this paper, a new systolic array for prime N-length DFT is first proposed, and then combined with Winograd Fourier Transform algorithm (WFTA) to control the increase of the hardware cost when the transform length is large The proposed new DFT design is both fast and hardware efficient Compared with the recently reported DFT design with computational complexity of O(log N), the proposed design saves the average number of required multiplications by 30 to 60% and reduces the average computation time by more than 2 times, when the transform length changes from 16 to 2048

Low-area FFT Processor Structure using Radix-4^2 Algorithm

Abstract: In this paper, a low-area FFT structure using algorithm is proposed. The large point FFT structure consists of cascade connection of the many stages. In implementation of large point FFT using algorithm, stages which number of different coefficients are only 3 appear in every 2 stages. For example, in the 4096-point FFT, the stages that number of different coefficients are 3 appear in stage 1, 3, and 5 among 6 stages. Multiplication block area of these 3 stages can be reduced using CSD(Canonic Signed Digit) and common sub-expression sharing techniques. Using the proposed structure, the 256-point FFT is implemented with the Verilog-HDL coding and synthesized by cell area in tsmc CMOS library. This result shows 23% cell area reduction compared with the conventional structure.

Research on the Simple Interpolated FFT Algorithm for Harmonic Power Energy Measurement

Abstract: This paper focuses on the introduction of a fast and high precision harmonic analysis algorithm used for power energy measurement. The derivation process of a novel approach to harmonic analysis for industrial power systems based on windowed fast Fourier transform is presented. And the formulas of the concerned harmonic parameters, i.e., frequency, phase, and amplitude, are given also, which is free of calculating high-order equations. The proposed algorithm has the major characters that the accuracy is comparable to the currently used polynomial fitting interpolation algorithm, but the calculation speed is improved by more than 10% and can be easily implemented by hardware multipliers, making the method a good choice for real-time applications. The simulation results and application in the embedded computer STM32F407 based three-phase harmonic power energy meter validated the practicability and efficiency of the proposed algorithm.

Fast DFT matrices transform based on generalized prime factor algorithm

Abstract: Inspired by fast Jacket transforms, we propose simple factorization and construction algorithms for the M -dimensional discrete Fourier transform (DFT) matrices underlying generalized Chinese remainder theorem (CRT) index mappings. Based on successive coprime-order DFT matrices with respect to the CRT with recursive relations, the proposed algorithms are presented with simplicity and clarity on the basis of the yielded sparse matrices. The results indicate that our algorithms compare favorably with the direct-computation approach.