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.

Benchmarks for Discrete Fourier Transform (DFT) calculations in R

Abstract: The DFT calculator in R,stats::fft, uses the Mixed-Radix algorithm of Singleton (1969). In this vignette we show how this calculator compares toFFT in thefftw package (Krey et al., 2011), which uses the FFTW algorithm of Frigo and Johnson (2005). For univariate DFT computations, the methods are nearly equivalent with two exceptions which are not mutually exclusive: (1) the series to be transformed is very long (10 6 terms), and especially (2) when the series length is not highly composite. In both exceptions the algorithm FFT outperformsfft. Update: I have decided that (for now)psd will not usefftw::FFT, despite its advantage overstats::fft for large-n ‘NHC’ series, simply because the binaries on CRAN have not been reliably built for some time now. If they do become reliable, I may consider using fftw::FFT instead.

Performance Analysis of an Area Efficient and Low Power MOD-R2MDC FFT for MIMO OFDM

Abstract: In this paper, an area-efficient low power fast fourier transform (FFT) processor is proposed for multi input multi output-orthogonal frequency division multiplexing (MIMO-OFDM) in wireless communication system. It consists of a modified architecture of radix-2 algorithm which is described as modified radix-2 multipath delay commutation (MOD-R2MDC). The OFDM receiver with modified R2MDC (MOD-R2MDC) FFT was designed by Hardware Description Language (HDL) coding The Xilinx ISE Design Suite 10.1 is used as a synthesis tool for getting the power and area. The Model-Sim 6.3c is used for simulation. Also the existing OFDM system has been tested with these FFT algorithms and their performances were analyzed with respect to occupancy area in FPGA and power consumption. A low-power and area efficient architecture enables the real-time operations of MIMO OFDM system.

A Fast Computation Algorithm of Binocular Energy Model

Abstract: This paper presents a fast computation algorithm of binocular energy model (BEM) to estimate the global disparity between a pair of stereoscopic images. The previous methods estimated the global disparity by using the convolution of receptive field function and stereoscopic images. But, it is known that the above approaches take a long time to obtain the required output. Hence, in this paper, we propose a fast computation algorithm by replacing the convolution with a multiplication operation in frequency domain. We can transform the image and the receptive field function into the frequency domain with the well-known fast Fourier transform called FFT. Then the output of the linear neurons is calculated simply with the inverse FFT (IFFT). The remaining process is the same as the previous approaches. With experimental results, we show that the proposed method can obtain the same global disparity as the previous schemes while reducing the computing time to 1/5 approximately.

Phase retrieval based on the Wigner distribution

Abstract: The Gerschberg-Saxton (GS) algorithm is a classic algorithm for phase retrieval. It is usually based on FFT (fast Fourier transform) and IFFT (inverse fast Fourier transform). We improve the GS algorithm based on the Wigner distribution. Instead of FFT and IFFT, Wigner distribution is not only used in the propagation but also filtered to optimize the signal during the iteration. The simulation results illustrate that the new method could effectively improve the efficiency and accuracy of phase retrieval.