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.

Correction of some formulas of Agarwal's fast Fourier transform least‐squares algorithm

Abstract: Correction of formulas (34), (37) and (38) of Agarwal's fast Fourier transform least-squares algorithm [Acta Cryst. (1978), A34, 791-809].

Fast computation of DFT of 2-D data with symmetry about two diagonals

Abstract: A fast algorithm to compute the DFT of a diagonally symmetric 2-D array is presented. The algorithm is developed employing the techniques of the multidimensional Winograd Fourier transform algorithm. First, the derivation of the algorithm is presented for quadrantally symmetric 2-D data of size N*N, where N is a prime number. Then a method of converting diagonally symmetric 2-D data and its transform into quadrantally symmetric data and its transform is derived. This is then used to develop the fast symmetry-based algorithm for the DFT of diagonally symmetric data. The new algorithm reduces the required number of multiplications and additions by about 70% for quadrantally or diagonally symmetric 2-D data. >

Fourier Domain Analysis performances of a RESPER probe - Amplitude and Phase inaccuracies due to the Round-Off noise of FFT processors

Abstract: This report proposes to discuss the Fourier domain analysis performances of a RESPER probe. A uniform ADC, which is characterized by a sensible phase inaccuracy depending on frequency, is connected to a Fast Fourier Transform (FFT) processor, that is especially affected by a round-off amplitude noise linked to both the FFT register length and samples number. If the register length is equal to 32 bits, then the round-off noise is entirely negligible, else, once bits are reduced to 16, a technique of compensation must occur. In fact, oversampling can be employed within a short time window, reaching a compromise between the needs of limiting the phase inaccuracy due to ADC and not raising too much the number of averaged FFT values sufficient to bound the round-off. Finally, the appendix presents an outline of somewhat lengthy demonstrations needed to calculate the amplitude and especially phase inaccuracies due to the round-off noise of FFT processors.

An approach to implement VSS-LMS algorithm in frequency domain for adaptive noise cancellation

Abstract: This paper presents the Variable Step Size Least Mean Square algorithm formulated in frequency domain by taking the (Fast Fourier Transform) FFT of signal obtained from filter. This way the algorithms performed better than its implementation in time domain in terms of Signal to Noise Ratio (SNR). The algorithms implemented in MATLAB with different colored noise surroundings. To evaluate the performance of the algorithm its comparison has been done with time domain. The algorithm has given 5–44% increased SNR compared to that implemented in time domain with different type of colored noises. The algorithm has also been tested in frequency domain for different step sizes.

Color pattern recognition using fast quaternion correlation algorithm

Abstract: Quaternion correlation techniques take advantage of high recognition precision and strong noise tolerance have been widely used in mangy application of color image processing. In this paper, a fast color pattern recognition algorithm based on quaternion correlation techniques is proposed. By traditional complex fast Fourier transform, a more efficient quaternion correlation algorithm was applied in the color pattern recognition aim at enhancing the efficiency of available algorithm. Experimental results on synthetic and natural images verify our arguments throughout the paper.