Topic
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.
Papers published on a yearly basis
Papers
More filters
Posted Content•
TL;DR: This paper analyzes two common descriptions of FFT, and proposes a new heuristic description that is helpful for students and programmers to grasp the algorithm entirely and deeply.
Abstract: Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of FFT and propose a new presentation. Our heuristic description is helpful for students and programmers to grasp the algorithm entirely and deeply.
1 citations
31 May 2016
1 citations
01 Jan 2005
TL;DR: Studies from theoretically analysis show that FFT algorithm of dishing network has higher accelerate ratio and total efficiency when it is parallel processed, and it is significative to realize the parallel real-time system of F FT algorithm.
Abstract: Based on the analysis of serial FFT algorithm and its shortage, this paper presents studies from theoretically analysis that FFT algorithm of dishing network has higher accelerate ratio and total efficiency when it is parallel processed, it is significative to realize the parallel real-time system of FFT algorithm.
1 citations
09 Jul 2015
TL;DR: The paper presents an architecture of a module for computation of a Discrete Fourier Transform with a Fast Fourier transform algorithm that is optimized for low area implementation and is suitable for implementation in application specific integrated circuits (ASIC).
Abstract: The paper presents an architecture of a module for computation of a Discrete Fourier Transform with a Fast Fourier Transform algorithm. The architecture is optimized for low area implementation and is suitable for implementation in application specific integrated circuits (ASIC). Software in C++ was written for automatic FFT module generation with various parameters. The software generates fully synthesizable VHDL code and SystemVerilog testbench for verification.
1 citations
28 Apr 1995
TL;DR: This work presents a new MD FFT algorithm capable of saving computation in front of general signal's symmetries, and can take advantage of even and odd parity's asymmetries for reducing the computation.
Abstract: Symmetric signals are defined by subsets of their support which depend on the specific symmetry. Depending on the symmetry, the cardinality of these subsets may be much smaller than that of the supports. The DFT of the symmetric signals enjoys symmetries related to the input symmetry, by which the DFT is defined by subsets the same as those defining the input signal. In principle, the computation of the DFT of symmetric signal can only use the input subset sufficient for defining the signal. In practice, all known MD FFT algorithms can only take advantage of even and odd parity's symmetries, and cannot exploit general signal symmetries for reducing the computation. This work presents a new MD FFT algorithm capable of saving computation in front of general signal's symmetries.
1 citations