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
13 Sep 1998
TL;DR: A new VLSI-oriented fast Fourier transform (FFT) algorithm-radix-2/4/8, which can effectively minimize the number of complex multiplications and is designed for use in the DVB application in 0.3 V triple-metal CMOS process.
Abstract: In this paper, we present a new VLSI-oriented fast Fourier transform (FFT) algorithm-radix-2/4/8, which can effectively minimize the number of complex multiplications. This algorithm can be implemented efficiently using a pipelined architecture. Based on this pipelined architecture, an 8 K FFT ASIC is designed for use in the DVB (Digital Video Broadcasting) application in 0.6 /spl mu/m-3.3 V triple-metal CMOS process.
111 citations
CNET1
TL;DR: This algorithm belongs to that class of recently proposed 2n-FFT's which present the same arithmetic complexity (the lowest among any previously published one) and can easily be applied to real and real symmetric data with reduced arithmetic complexity by removing all redundancy in the algorithm.
Abstract: A new algorithm is presented for the fast computation of the Discrete Fourier Transform. This algorithm belongs to that class of recently proposed 2n-FFT's which present the same arithmetic complexity (the lowest among any previously published one). Moreover, this algorithm has the advantage of being performed "in-place", by repetitive use of a "butterfly"- type structure, without any data reordering inside the algorithm. Furthermore, it can easily be applied to real and real symmetric data with reduced arithmetic complexity by removing all redundancy in the algorithm.
109 citations
TL;DR: A fast digital Radon transform based on recursively defined digital straight lines is described, which has the sequential complexity of N^2 log N additions for an N x N image and is shown to be quite similar to the FFT algorithm for decimation in frequency.
108 citations
TL;DR: A simple procedure for designing finite-extent impulse response (FIR) discrete-time filters using the FFT algorithm is described and extension of the design method to higher dimensions is straightforward.
Abstract: The fast Fourier transform (FFT) algorithm has been used in a variety of applications in signal and image processing. In this article, a simple procedure for designing finite-extent impulse response (FIR) discrete-time filters using the FFT algorithm is described. The zero-phase (or linear phase) FIR filter design problem is formulated to alternately satisfy the frequency domain constraints on the magnitude response bounds and time domain constraints on the impulse response support. The design scheme is iterative in which each iteration requires two FFT computations. The resultant filter is an equiripple approximation to the desired frequency response. The main advantage of the FFT-based design method is its implementational simplicity and versatility. Furthermore, the way the algorithm works is intuitive and any additional constraint can be incorporated in the iterations, as long as the convexity property of the overall operations is preserved. In one-dimensional cases, the most widely used equiripple FIR filter design algorithm is the Parks-McClellan algorithm (1972). This algorithm is based on linear programming, and it is computationally efficient. However, it cannot be generalized to higher dimensions. Extension of our design method to higher dimensions is straightforward. In this case two multidimensional FFT computations are needed in each iteration.
108 citations
TL;DR: A particularly simple way to control fast Fourier transform (FFT) hardware that allows parallel organization of the memory such that at any stage the two inputs and outputs of each butterfly belong to different memory units, hence can always be accessed in parallel.
Abstract: A particularly simple way to control fast Fourier transform (FFT) hardware is described. The method produces the indices both for inputs of each butterfly operation and for the appropriate W. In addition, this method allows parallel organization of the memory such that at any stage the two inputs and outputs of each butterfly belong to different memory units, hence can always be accessed in parallel.
108 citations