Topic
Split-radix FFT algorithm
About: Split-radix FFT algorithm is a research topic. Over the lifetime, 1845 publications have been published within this topic receiving 41398 citations.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: The proposed design of a new hardware efficient fast cyclic convolution algorithm for small-length DFT can save large amount of hardware cost with the same processing speed when the transform length is long and the processing speed can be flexible and balanced with the hardware cost.
Abstract: A primeN-length discrete Fourier transform (DFT) can be reformulated into a (N-1)-length complex cyclic convolution and then implemented by systolic array or distributed arithmetic. In this paper, a recently proposed hardware efficient fast cyclic convolution algorithm is combined with the symmetry properties of DFT to get a new hardware efficient fast algorithm for small-length DFT, and then WFTA is used to control the increase of the hardware cost when the transform length Nis large. Compared with previously proposed low-cost DFT and FFT algorithms with computation complexity of O(logN), the new algorithm can save 30% to 50% multipliers on average and improve the average processing speed by a factor of 2, when DFT length Nvaries from 20 to 2040. Compared with previous prime-length DFT design, the proposed design can save large amount of hardware cost with the same processing speed when the transform length is long. Furthermore, the proposed design has much more choices for different applicable DFT transform lengths and the processing speed can be flexible and balanced with the hardware cost
34 citations
••
TL;DR: A simple algorithm is described for computing general pseudo-differential operator actions based on the asymptotic expansion of the symbol together with the fast Fourier transform, which shows that the algorithm is efficient through analyzing its complexity.
Abstract: A simple algorithm is described for computing general pseudo-differential operator actions. Our approach is based on the asymptotic expansion of the symbol together with the fast Fourier transform (FFT). The idea is motivated by the characterization of the pseudo-differential operator algebra. We show that the algorithm is efficient through analyzing its complexity. Some numerical experiments are also presented.
34 citations
••
12 Nov 2017TL;DR: Wang et al. as mentioned in this paper presented an online ABFT scheme for FFT so that soft errors can be detected online and the corrupted computation can be terminated in a much more timely manner.
Abstract: While many algorithm-based fault tolerance (ABFT) schemes have been proposed to detect soft errors offline in the fast Fourier transform (FFT) after computation finishes, none of the existing ABFT schemes detect soft errors online before the computation finishes. This paper presents an online ABFT scheme for FFT so that soft errors can be detected online and the corrupted computation can be terminated in a much more timely manner. We also extend our scheme to tolerate both arithmetic errors and memory errors, develop strategies to reduce its fault tolerance overhead and improve its numerical stability and fault coverage, and finally incorporate it into the widely used FFTW library - one of the today's fastest FFT software implementations. Experimental results demonstrate that: (1) the proposed online ABFT scheme introduces much lower overhead than the existing offline ABFT schemes; (2) it detects errors in a much more timely manner; and (3) it also has higher numerical stability and better fault coverage.
33 citations
••
21 Apr 1997TL;DR: An algorithm that uses the discrete wavelet transform as a tool to compute the discrete Fourier transform (DFT) and the Cooley-Tukey FFT is shown to be a special case of the proposed algorithm when the wavelets in use are trivial.
Abstract: We propose an algorithm that uses the discrete wavelet transform (DWT) as a tool to compute the discrete Fourier transform (DFT). The Cooley-Tukey FFT is shown to be a special case of the proposed algorithm when the wavelets in use are trivial. If no intermediate coefficients are dropped and no approximations are made, the proposed algorithm computes the exact result, and its computational complexity is on the same order of the FFT, i.e. O(N log/sub 2/ N). The main advantage of the proposed algorithm is that the good time and frequency localization of wavelets can be exploited to approximate the Fourier transform for many classes of signals resulting in much less computation. Thus the new algorithm provides an efficient complexity vs. accuracy tradeoff. When approximations are allowed, under certain sparsity conditions, the algorithm can achieve linear complexity, i.e. O(N). The proposed algorithm also has built-in noise reduction capability.
33 citations
••
TL;DR: A nonuniform inverse fast Fourier transform (NU-IFFT) for non ununiformly sampled data is realised by combining the conjugate-gradient fast Fouriers transform (CG-FFT) method with the newly developed NUFFT algorithms.
Abstract: A nonuniform inverse fast Fourier transform (NU-IFFT) for nonuniformly sampled data is realised by combining the conjugate-gradient fast Fourier transform (CG-FFT) method with the newly developed nonuniform fast Fourier transform (NUFFT) algorithms. An example application of the algorithm in computational electromagnetics is presented.
33 citations