Topic
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.
Papers published on a yearly basis
Papers
More filters
Patent•
26 Feb 1996
TL;DR: A real-time pipeline processor based on a hardware oriented radix-22 algorithm derived by integrating a twiddle factor decomposition technique in a divide and conquer approach is presented in this paper.
Abstract: A real-time pipeline processor, which is particularly suited for VLSI implementation, is based on a hardware oriented radix-22 algorithm derived by integrating a twiddle factor decomposition technique in a divide and conquer approach. The radix-22 algorithm has the same multiplicative complexity as a radix-4 algorithm, but retains the butterfly structure of a radix-2 algorithm. A single-path delay-feedback architecture is used in order to exploit the spatial regularity in the signal flow graph of the algorithm. For a length-N DFT transform, the hardware requirements of the processor proposed by the present invention is minimal on both dominant components: Log?4?N-1 complex multipliers, and N-1 complex data memory.
3 citations
15 Feb 1979
TL;DR: The new DFT algorithm of S. Winograd is developed and presented in detail and is applicable to any order which is a product of relatively prime factors from the following list: 2,3,4,5,7,8,9,16.
Abstract: The new DFT algorithm of S. Winograd is developed and presented in detail. This is an algorithm which uses about 1/5 of the number of multiplications used by the Cooley-Tukey algorithm and is applicable to any order which is a product of relatively prime factors from the following list: 2,3,4,5,7,8,9,16. The algorithm is presented in terms of a series of tableaus which are convenient, compact, graphical representations of the sequence of arithmetic operations in the corresponding parts of the algorithm. Using these in conjunction with included Tables makes it relatively easy to apply the algorithm and evaluate its performance.
3 citations
Journal Article•
TL;DR: Both analysis and simulation demonstrate that compared with the existing FFT-based code acquisition scheme, the proposed algorithm can increase the PMF integration time to reduce the FFT complexity with the same degradation of the maximum of the spectrum.
Abstract: The FFT-based code acquisition scheme and the way to choose the length of PMF integration time were analyzed. A novel windowed PMF-FFT algorithm was proposed. In the algorithm, the data was weighted by hanning window before PMF integration. And then the integrated data was analyzed by FFT. The performances of the algorithm were analyzed. Both analysis and simulation demonstrate that compared with the existing FFT-based code acquisition scheme, the proposed algorithm can increase the PMF integration time to reduce the FFT complexity with the same degradation of the maximum of the spectrum, and reduce the degradation and the leak of the spectrum to improve the acquisition performance with the same PMF integration time.
3 citations
25 May 2008
TL;DR: A parallel FFT course and its scheduling scheme in multi-machines environment were introduced and how to do further optimization on this scheme for the optimal accelerating rate was discussed.
Abstract: As a basic operation of signal processing, discrete Fourier transform (DFT) has a strict demand with executing speed. However, the current widely used fast Fourier transform (FFT) which can greatly accelerate DFT can't still adapt to the required speed when the data amount is tremendous. There is an awareness of that parallel schemes can be an efficient way to accelerate the FFT computing. In this paper, a parallel FFT course and its scheduling scheme in multi-machines environmentwere introduced. How to do further optimization on this scheme for the optimal accelerating rate was discussed, and some basic principles were pointed out.
3 citations
Patent•
22 Mar 2001TL;DR: In this article, a Fast Fourier Transform (FFT) based voice synthesis method was proposed for complex sounds, e.g., male voices and unvoiced speech, and sine wave summation 100 for simpler sounds, such as female voices.
Abstract: A Fast Fourier Transform (FFT) based voice synthesis method 110, program product and vocoder. Sounds, e.g., speech and audio, are synthesized from multiple sine waves. Each sine wave component is represented by a small number of FFT coefficients 116. Amplitude 120 and phase 124 information of the components may be incorporated into these coefficients. The FFT coefficients corresponding to each of the components are summed 126 and, then, an inverse FFT is applied 128 to the sum to generate a time domain signal. An appropriate section is extracted 130 from the inverse transformed time domain signal as an approximation to the desired output. FFT based synthesis 110 may be combined with simple sine wave summation 100, using FFT based synthesis 110 for complex sounds, e.g., male voices and unvoiced speech, and sine wave summation 100 for simpler sounds, e.g., female voices.
3 citations