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
23 Sep 1991
TL;DR: A new DFT implementation incorporating distributed arithmetic with the DFT is reported, which proves to be faster and to require less area than the direct implementation of the FFT.
Abstract: A new DFT implementation incorporating distributed arithmetic with the DFT is reported. This method proves to be faster and to require less area than the direct implementation of the FFT. >
TL;DR: A simple systolic architecture for the computation of the DFT using the Winograd Fourier Transform algorithm is presented and is shown to be problem-size independent and to satisfy the limited bandwidth constraint.
TL;DR: This paper treats the fault-detection methods of the F FT-CN (FFT calculation network) under the assumptions that the FFT-CN is made up of N/2, x log2N two-input butterfly modules, that its N inputs are all restricted to the real values, and that the detection of the fault is performed by the comparison of the outputs of the network.
Abstract: Fast Fourier transform (FFT) is one of the techniques indispensable in signal processing. the recent development of hardware and parallel processing techniques makes it possible to use a specific chip circuit for signal processing such as FFT and in fact there exist systems that achieve high-speed computation of FFT. Such systems use many processors in a chip. Consequently, these are likely to have high error probability and require on-line fault detection. This paper treats the fault-detection methods of the FFT-CN (FFT calculation network) under the assumptions that the FFT-CN is made up of N/2, x log2N two-input butterfly modules, that its N inputs are all restricted to the real values, and that the detection of the fault is performed by the comparison of the outputs of the network. the assumed structure of the FFT-CN is symmetric so a simple fault-detection method would not be successful. But we will show here that the restriction of the inputs to real numbers makes it possible to find a fault in the FFT-CN.
01 Mar 2017
TL;DR: A real — time modified FFT algorithm for the demodulation of rail track frequency shift signal, which can solve the low frequency resolution and serious spectrum leakage in traditional F FT algorithm is presented.
Abstract: The track frequency shift signal is closely related to the safe operation of railway locomotives. This paper presents a real — time modified FFT algorithm for the demodulation of rail track frequency shift signal, which can solve the low frequency resolution and serious spectrum leakage in traditional FFT algorithm. Firstly, The sampling frequency is determined by bandpass sampling. Then, FFT algorithm with Manning window is designed. At the same time, polynomial approximation method is used to estimate the frequency and amplitude of the signal by using the maximum amplitude of two spectrum lines near the detection frequency, which corrects the spectrum leakage phenomenon when calculating the frequency shift signal by FFT. Finally, the simulation is carried out on MATLAB, and the experiment is carried out with DSP. The results show that the improved FFT algorithm can improve the accuracy and real-time of track frequency shift signal detection.
21 Jun 1998
TL;DR: Based on the CG-FFT method and the NUFFT (nonuniform FFT) algorithm, a new non-uniform inverse FFT (NU-IFFT) was developed for nonuniform data with a comparable complexity of O(N log/sub 2/N).
Abstract: Based on the CG-FFT method and the NUFFT (nonuniform FFT) algorithm, a new nonuniform inverse FFT (NU-IFFT) algorithm is developed for nonuniform data. With a comparable complexity of O(N log/sub 2/N), this algorithm is much more accurate than the previously reported results since it is optimal in the least squares sense.