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: Two programs are presented to compute direct- and cross-variogram values, direct andCross-covariograms, and pseudo-cross-variograms based on the Fast Fourier Transform algorithm, which is shown to be faster than the spatial approach for this type of data.
71 citations
TL;DR: This work pads the set of spectral coefficients with zeros and takes an FFT of length 3N to interpolate the Chebyshev series to a very fine grid, and applies either the Mth order Euler sum acceleration or (2M + 1)-point Lagrangian interpolation to approximate the sum of the series on the irregular grid.
71 citations
TL;DR: In this paper, an efficient VLSI architecture of a pipeline fast Fourier transform (FFT) processor capable of producing the normal output order sequence is presented and a sequence conversion method by integrating the conversion function into the last-stage data commutator module is presented.
Abstract: In this paper, an efficient VLSI architecture of a pipeline fast Fourier transform (FFT) processor capable of producing the normal output order sequence is presented. A new FFT design based on the decimated dual-path delay feed-forward data commutator unit by splitting the input stream into two half-word streams is first proposed. The resulting architecture can achieve full hardware efficiency such that the required number of adders can be reduced by half. Next, in order to generate the normal output order sequence, this paper also presents a sequence conversion method by integrating the conversion function into the last-stage data commutator module.
70 citations
TL;DR: A structured approach is used to generate a fast algorithm to compute two-dimensional discrete cosine transforms (DCT) based on Hou's method and this algorithm is described by logic diagrams which reveal the relationship between the 2-D algorithm and its 1-D counterpart.
Abstract: A structured approach is used to generate a fast algorithm to compute two-dimensional discrete cosine transforms (DCT) based on Hou's method. Hou's algorithm is extended to the 2-D case using an approach presented in both matrix and diagrammatical forms. The matrix approach is discussed, and this forms a basis on which a 2-D fast DCT algorithm is derived. It is shown that this matrix method has a structure similar to that of the 1-D Cooley-Tukey fast Fourier transform (FFT) algorithm. Then the decimation-in-frequency (DIF) 2-D fast DCT algorithm is presented using matrix forms which use the tensor (or Kronecker) product as a construction tool. Finally, the 2-D algorithm is described by logic diagrams which reveal the relationship between the 2-D algorithm and its 1-D counterpart. As an example, the logic diagram of an 8-point*8-point 2-D DCT using the new 2-D DCT algorithm is generated through a simple procedure. >
69 citations
TL;DR: The sliding fast Fourier transform is reviewed and is shown to have the computational complexity of N complex multiplications per sample, as opposed to the well-cited assumption of (N/2) log/sub 2/ N complex multiplication per sample.
Abstract: The sliding fast Fourier transform (FFT) is reviewed and is shown to have the computational complexity of N complex multiplications per sample, as opposed to the well-cited assumption of (N/2) log/sub 2/ N complex multiplication per sample reported in a book by L.R. Rabiner and B. Gold (1975). >
67 citations