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
TL;DR: This paper shows that the radix- structure is the most adequate because it shows the smallest complexity in the synthesis and the best SQNR performance.
Abstract: This paper compares radix-2 based structures for 32768-point FFT. Radix- structures have been widely used because the butterfly is simple and the number of multipliers can be reduced in those structures. This paper applied various radix- structures to 32768-point FFT that is representing ultra-long FFT. The ultra-long FFT has been studied much recently. This paper shows that the radix- structure is the most adequate because it shows the smallest complexity in the synthesis and the best SQNR performance. should be placed here.
Patent•
26 Mar 2012
TL;DR: In this paper, a small-area 64-point fast fourier transform (FFT) processor and an FFT method were presented, where each of the stages comprises a butterfly comprising an addition block and/or multiplication block and a delay commutator.
Abstract: Disclosed are a small-area 64-point fast fourier transform (FFT) processor and an FFT method. According to an embodiment of the present invention an FFT processor, which is an FFT processor of a decimation in frequency (DIF) type for an orthogonal frequency division multiplexing (OFDM) system, comprises at least three stages, and calculates a 64-point FFT using a radix-4² algorithm, wherein each of the stages comprises a butterfly comprising an addition block and/or multiplication block and a delay commutator; and performs butterfly calculations using CSD coefficients, defines common patterns for the CSD coefficients and shares same, and calculates twiddle factors using the defined CSD coefficients and performs common sub-expression sharing (CSS)-type butterfly calculations using adders and shifts.
01 Jan 2004
TL;DR: This paper shows a symmetrical decomposition of the Fast Fourier Transform into stages such that butterflies of small radices can be applied efficiently and negates the need for any temporary storage of the data and hence a more cost and area effective design.
Abstract: This paper shows a symmetrical decomposition of the Fast Fourier Transform (FFT) into stages such that butterflies of small radices can be applied efficiently. Due to symmetric, the bit reversal sorting is also symmetrical and allows semi in-place self-sorting to be carried out together with the butterfly processing at the middle stage. Furthermore, the mirroring effect due to the symmetry, halves the implementation effort of the remaining stages. No sorting of the data is required before or after the FFT processing, since they are all in-place. The in-place processing negates the need for any temporary storage of the data and hence a more cost and area effective design.
01 Jan 2012
TL;DR: The new improved MMSE-BLE algorithm based block FFT is studied through simulation that test and verify the algorithm’s performance and reduces the computing magnitude and the computational complexity and better improving the system performances.
Abstract: The main purpose of the Joint Detection (JD) techniques is an accurately estimating the user’s signal, the difficulty lies in the system matrix inversion, so to find the fast inversion algorithms is the main key to make better the JD algorithms. This paper, it studies the new improved MMSE-BLE algorithm based block FFT, and through simulation that test and verify the algorithm’s performance. The improved fast algorithm higher operational efficiency, the improved fast algorithm reduces the computing magnitude and the computational complexity and better improving the system performances.
01 Jan 2000
TL;DR: A new linogram algorithm is proposed for the high quality Fourier reconstruction of digital N x N images from their Radon transform that requires only O(N²log N) arithmetic operations and preserves the good reconstruction quality of the filtered backprojection.
Abstract: In this paper, we propose a new linogram algorithm for the high quality Fourier reconstruction of digital N x N images from their Radon transform. The algorithm is based on univariate fast Fourier transforms for nonequispaced data in the time domain and in the frequency domain. The algorithm requires only O(N²log N) arithmetic operations and preserves the good reconstruction quality of the filtered backprojection.