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.

Research on digital image encryption algorithm based on fractional Fourier transform

Abstract: This paper proposed a new approach of digital image encryption based on the fractional Fourier transform and chaos.The algorithm could be summarized as follows.Firstly,scrambled the image in time domain with chaos,and then combined it and the discrete fractional Fourier transform in X direction.Secondly,scrambled the image obtained in the fractional Fourier domain with chaos,and then combined it and the discrete fractional Fourier transform in Y direction.Finally,mapped the real and image part of the encrypted image to the RGB,forming a color image for transmission.The experiment results show that the algorithm performs considerable security,which has well research value and application foreground in the information security field.

Parallel FFT algorithm based on multi-threading technology

Abstract: On the basis of traditional serial FFT algorithms, a parallel FFT algorithm based on multi-threading is put forward The experiment data indicate that this new algorithm can improve the executive efficiency of program to a certain extent, compared with the traditional serial one, the speedup ratio of the efficiency of new algorithm will tend to the number of processors when adding to the working load

Improved QFT algorithm for power-of-two FFT

Abstract: This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification in this algorithm. The new algorithm requires the same number of additions and multiplications of split-radix 3add/3mul, one of the most appreciated FFT algorithms appeared in the literature, but employing only half of the trigonometric constants. These results can elevate the QFT approach to the level of most used FFT procedures. A new quite general way to describe FFT algorithms, based on signal types and on a particular notation, is also proposed and used, highligting its advantages.

Fast radar imaging algorithm for the detection of objects embedded in a stratified medium

Abstract: An efficient algorithm is proposed to reconstruct the 3D image of objects embedded in a multi-layered medium. Under the first-order Born approximation, the spectral domain dyadic Green's function for an arbitrary layered medium is used to obtain a linear relation between the spatial Fourier transform of the object function and the scattered field. The algorithm is efficiently implemented using the fast Fourier transform (FFT) to construct image slices as a function of depth in the medium. An experimental example is presented to show the efficiency of the proposed algorithm.

Convergence of a recursive rational interpolation-based identification algorithm

Abstract: This paper investigates the convergence properties of an identification algorithm based on recursive rational interpolation. The algorithm utilizes the moving discrete Fourier transform (MDFT), which is a recursive form of the DFT, to efficiently monitor certain points in the spectra of the system input and output signals. Convergence of parameter estimates to their true values is established for the algorithm, and persistent excitation conditions are also given. >