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
14 May 2000
TL;DR: This work uses the four-step and five-step algorithms to implement the parallel one-dimensional FFT algorithms and achieves high-performance performance results on a distributed memory parallel computer with (pseudo) vector SMP nodes, HITACHI SR8000.
Abstract: We propose high-performance parallel one-dimensional fast Fourier transform (FFT) algorithms for distributed memory parallel computers with vector symmetric multiprocessor (SMP) nodes. The four-step FFT algorithm can be altered into a five-step FFT algorithm to expand the innermost loop length. We use the four-step and five-step algorithms to implement the parallel one-dimensional FFT algorithms. In our proposed parallel FFT algorithms, since we use cyclic distribution, all-to-all communication takes place only once. Moreover, the input data and output data are both in natural order. Performance results of one-dimensional power-of-two FFTs on a distributed memory parallel computer with (pseudo) vector SMP nodes, HITACHI SR8000, are reported. We succeeded in obtaining performance of about 38 GFLOPS on a 16-node SR8000.
16 citations
06 Apr 2003
TL;DR: An algorithm suitable for convolving two finite length sequences of uneven length that is more efficient than its FFT-based competitor and can reduce the computational complexity by a third is developed.
Abstract: We develop an algorithm suitable for convolving two finite length sequences of uneven length that is more efficient than its FFT-based competitor. In particular, we present a method for computing a fast linear convolution of the finite length sequences h and x where the length of x is much greater than the length of h using the Hirschman optimal transform (HOT). When compared to the most efficient methods using the DFT and its fast FFT implementation, our method can reduce the computational complexity by a third.
16 citations
Patent•
25 Apr 2007
TL;DR: In this article, a method of reducing noise in a speech signal using a fast Fourier transform (FFT) is proposed. But the method is not suitable for the frequency domain.
Abstract: A method of reducing noise in a speech signal involves converting the speech signal to the frequency domain using a fast fourier transform (FFT), creating a subset of selected spectral subbands, determining the appropriate gain for each subband, and interpolating the gains to match the number of FFT points. The converted speech signal is then filtered using the interpolated gains as filter coefficients, and an inverse FFT performed on the processed signal to recover the time domain output signal.
16 citations
TL;DR: This work shows how to compute the discrete Fourier transform at n points with an optimal speed-up as long as the memory is large enough and the control is shown to be simple and easily implementable in VLSI.
16 citations
01 Dec 2013
TL;DR: A pipeline FFT architecture is proposed, which supports FFT lengths of power-of-two multiple of three and is memory optimal as for N-point transform only N - 1 memory locations are needed.
Abstract: Modern wireless communication systems use orthogonal frequency division multiplexing (OFDM) and multiple input multiple output (MIMO) schemes, which call for fast Fourier transforms (FFT) Traditionally power-of-two FFT lengths have been exploited but recently also non-power-of-two transform lengths have been defined For example, 3GPP LTE specification defines 1536- point FFT In this paper, we propose a pipeline FFT architecture, which supports FFT lengths of power-of-two multiple of three The architecture is basically single delay feedback structure followed by radix-3 computation unit The proposed architecture is memory optimal as for N-point transform only N - 1 memory locations are needed
16 citations