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.

Optimized design of memory access for twiddle factors in FFT algorithm

Abstract: In order to run Fast Fourier Transform(FFT) algorithm more efficiently in embedded devices,an optimized design of twiddle factors for the small Cache was presented.The design can effectively enhance read-percent cache hits and improve processing speed.The selection principle of configuration parameters in different needs was given and the experimental results based on typical configuration parameters and target processor were discussed.It is proved that this optimized method can effectively improve processing speed with slight Signal to Noise Ratio(SNR) decrease.

Effective properties prediction of composites based on FFT method

Abstract: The problem of composites is transformed into the problem of isotropic materials with polarization stress,whose formal solution can be achieved based on Lippmann-Schwinger equation.Numerical algorithms and specific examples were given using FFT method,whose results were compared with the results of experiment in the literature and other numerical results.The results show that FFT method is effective for predicting the effective properties of composites.Finally the resolution and size effect of FFT method were discussed.The results show that resolution has an effect on FFT method,but size effect has few effect on FFT method.

Two parallel 1-d fft algorithms without all-to-all communication

Abstract: Computing the 1-D Fast Fourier Transform (FFT) using the conventional six-step FFT algorithm on parallel computers requires intensive all-to-all communication due to the necessity of matrix transpose in three steps. This all-to-all communication is a limiting factor in improving the performance of FFT in its parallel implementations. In this paper, we present two parallel algorithms for implementing the 1-D FFT without all-to-all communication between processors, at the expense of increased inner-processor computation as compared to the conventional six-step FFT algorithm. Our analysis reveals the advantage of these two algorithms over the six-step FFT algorithm in parallel systems where the cost of inter-processor communication outweighs the cost of inner-processor computation. As a case study, we choose a 32-node Beowulf cluster with fast processors (running at 2 GHz) but relatively slow inter-processor communication (over a 100 Mbit/s switch). Simulation results on this cluster demonstrate that the proposed no-communication FFT algorithms can achieve a speedup ranging from 1.1 to 1.5 over the six-step FFT algorithm.

An Algorithm for Binary Image Restoration

Abstract: In this paper, we consider the problem to recover a blurred and noisy binary images when the point spread function (PSF) is known. By explicitly using the a priori knowledge for binary image in the constrained minimization model, we present a fast algorithm for binary image restoration. The main computation at each iteration is one Fourier transform (FFT) and one inverse fast Fourier transform (IFFT). Experimental results show that the proposed method is feasible and effective for binary image restoration.

Implementation of prime transform algorithm using c.c.d. programmable transversal filter

Abstract: An economic scheme is proposed for implementing the prime transform algorithm using charge-coupled device programmable transversal filters.