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.

Constraints on the SIMD vectorization of radix-2 and mixed-radix FFTS

Abstract: Single instruction, multiple data (SIMD) signal processors for wireless communications require efficient vectorized algorithms for radix-2 and mixed-radix Fast Fourier Transforms (FFTs). Especially, mixed-radix FFTs are challenging for a processor that operates on power-of-two length vectors. We analyze the vectorization of pure radix-2 and mixed-radix FFTs and demonstrate that both FFTs have different constraints for an efficient vectorization. The radix-2 FFT can be efficiently vectorized if the FFT length is at least twice the vector length while the mixed-radix FFT requires the FFT length to be a multiple of the squared vector length.

Modulated FFT and its application in the discrete spectrum correction

Abstract: In view of half of the calculation results are redundant during traditional Fast Fourier transform(FFT),a novel algorithm based on modulated FFT of real signals is proposed to solve the problem.The algorithm shifts frequency of real signals by time domain modulation before turning to the traditional FFT,which breaks the symmetry of frequency domain.Thus,the frequency resolution can be double increased and the accuracy of frequency positioning and anti-noise performance can be improved as well.In this paper,Ratio Correction and Phase Difference Correction on discrete spectrum are taken as examples,in which the Modulated FFT has been applied to discrete spectrum correction technology.It can solve the problems due to the influence of noise,by applying discrete spectrum correction methods based on FFT.And the correction accuracy and anti-noise performance can be further improved.Both theoretical analysis and Monte Carlo computer simulation method prove that the proposed algorithm is correct and effective.

Design of Biometric Fingerprint Image Enhancement Algorithm by using Iterative Fast Fourier Transform

Abstract: Among all the minutia based fingerprint identification system, the performance depends on the quality of input fingerprint images. In this paper, we have designed and implemented an algorithm of fingerprint image enhancement by using Iterative Fast Fourier Transform (IFFT). We have designed an approach for removing the false minutia generated during the fingerprint processing and a method to reduce the false minutia to increase the efficacy of identification system. We have used fingerprint Verification Competition 2006 (FVC 2006) as a database for implementation of proposed algorithm. Experimental results show that the results of our enhancement algorithm are better than existing algorithm of fast Fourier transform.

Power Quality Disturbance Classification Based on S Transform and Fourier Transform

Abstract: A new detection and classification method of power quality disturbances based on S transform,interpolating windowed fast Fourier transform(FFT) and probabilistic neural network(PNN) was proposed.S transform and interpolating windowed FFT was first applied to perform time-frequency analysis on power quality disturbance samples,and the features can then be extracted from the results.These features are then used to train a PNN for disturbance classification.Results of applying the trained PNN on a test set with common power quality disturbances show that the method has relatively high classification accuracy.In the presence of smaller training set,higher noise level,and multiple types of disturbances,the proposed method can still achieve good classification.