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.

Rife-Vincent (I) Window Interpolated FFT Algorithm Based on Cubic Spline Function

Abstract: In order to further improve the precision of harmonics measurement, the paper provides a new interpolation fast Fourier transform (FFT) algorithm based on RifeVincent (I) window. By using the cubic spline function to approach the ninth multinomial of frequency modification coefficient and the function of harmonic amplitude correction of the interpolation FFT algorithm based on RifeVincent (I) window, the computing speed has been improved. It can solve the contradiction between calculation accuracy and computational speed of windowed and interpolated FFT algorithm. The simulative results show that RifeVincent (I) window interpolation algorithm by using cubic spline function has the amplitude error less than 0.00001 %, the frequency error less than 0.000001 Hz, and the phase error less than 0.01%.

Fast discrete Fourier transform and inverse transform digital-analog hybrid integrated circuit using prime factor algorithm

Abstract: The mixed digital and analogue fast discrete Fourier transformation circuit and mixed digital and analogue fast discrete inverse Fourier transformation circuit adopting prime number factor algorithm perform transformation of analogue signal directly without converting the analogue signal into digital signal The present invention includes the first stage of sample/holding circuit to analyze N complex number series into 2D N1*N2 series and to feed the result to the first stage of Fourier transformation circuit; the first stage of Fourier transformation circuit to perform N2 times DFT transformations of N1 length; the second sample/holding circuit to hold the result of the first Fourier transformation and feed the data to the second stage of Fourier transformation circuit; the second stageof Fourier transformation circuit to perform the N1 times length N2 DFT transformations to obtain the ultimate Fourier transformation result The present invention has no multiplying twiddle factor circuit and is simple in structure, fast and low in power consumption

Digital implementation of fractional Fourier transform hologram

Abstract: Digital implementation of fractional Fourier transform hologram (FRTH) is studied. From the definition of fractional Fourier transform (FRT), its discrete form is obtained and then a fast FRT algorithm is generated based on fast Fourier transform (FFT). Therefore, with the algorithm whose numerical efficiency is equal to the FFT, FRT can be quickly calculated and moreover FRTCGH can be efficiently encoded and reconstructed. The digital implementation for FRTH can lead its advantages, such as flexibility of fabrication and variation with recording system parameters, to expanding its application fields in FRT and holography.

Multiple-valued FFT processor design using current mode CMOS

Abstract: In this study, Multi-Values Logic processor was designed using the basic circuit of the electric current mode CMOS. First of all, binary FFT(Fast courier Transform) was extended and high-speed Multi-Valued Logic processor was constructed using a multi valued logic circuit. Compared with the existing two-valued FFT, the FFT operation can reduce the number of transistors significantly and show the simplicity of the circuit. Moreover, for the construction of amount was used inside the FFT circuit with the set of redundant numbers like {0, 1, 2, 3}. As a result, the defects in lines were reduced and it turned out to be effective in the aspect of normality an regularity when it was used designing VLSI(Very Large Scale Integration). To multiply FFT, the time and size of the operation was used toed as LUT(Lood Up Table).

Sparse interpolation, the FFT algorithm and FIR filters

Abstract: In signal processing, the Fourier transform is a popular method to analyze the frequency content of a signal, as it decomposes the signal into a linear combination of complex exponentials with integer frequencies. A fast algorithm to compute the Fourier transform is based on a binary divide and conquer strategy.