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.

Research on Parallel Calculation of Fast Fourier Transform Based on Complex Sequence

Abstract: In this paper, we take Fourier transform (FFT) algorithm for example, which is the most important algorithm in harmonic detection. we propose an OpenMP implementation of a Modified FFT Based on Complex Sequence on shared memory parallel computers. The paper also start from computer architecture, we describe how to turn our program into cache friendly and can take full advantage of processor. Performance results of one-dimensional FFTs on the DELL GX620 and the ADVANTECH MIC-3392 are reported. Experiments prove that use OpenMP to rewrite large amounts of data calculation code, efficient multi-threaded reconstruction. FFT implementations could not be realized so far.

High-speed Radix-8 FFT Structure for OFDM

Abstract: In this paper, a Radix-8 structure for high-speed FFT is propose. Main block of the proposed FFT structure is Radix-8 DIF(Decimation In Frequency) butterfly. Even throughput of the Radix-8 FFT is twice than that of the Radix-4 FFT, implementation area of the Radix-8 is larger than that of Radix-4 FFT. But, implementation area of the proposed Radix-8 FFT was reduced by using DA(Distributed Arithmetic) for multiplication. For comparison, the 64-point FFT was implemented using conventional Radix-4 butterfly and proposed Radix-8 butterfly, respectively. The Verilog-HDL coding results for the proposed FFT structure show 49.2% cell area increment comparison with those of the conventional Radix-4 FFT structure. Namely, to speed up twice, 49.2% of area cost is required. In case of same throughput, power consumption of the proposed structure is reduced by 25.4%. Due to its efficient processing scheme, the proposed FFT structure can be used in large size of FFT like OFDM Modem.

Fast Jacket transform for DFT matrices based on prime factor algorithm

Abstract: Underlying the prime factor algorithm (PFA) employed Chinese remainder theorem (CRT), one-dimensional DFT can be mapped to the true two-dimensional DFT avoid twiddle factors Enlighten by the idea of fast Jacket transform, a simple construction for large size DFT matrices is proposed Based on the multi-dimensional index mapping extended from two-dimensional case, a general approach to decompose multi-dimensional DFT matrices is described in simple manner The proposed algorithms are presented for simplicity and clarity for it only minimally related to sparse matrices The results indicate the presented fast algorithms compare favourably with direct computation

Research on fast acquisition algorithm of spread spectrum signal based on PMF-FFT

Abstract: Aiming at the attenuation problem when doppler frequency shift is large, pmF-FFT algorithm based on matched filter is introduced to compensate the attenuation of matched filter through FFT method, but at the same time, PMF-FFT algorithm also introduces scallop loss due to the introduction of FFT operation. In this paper, the mathematical model of PMF-FFT algorithm is given, the basic principle of acquisition is analyzed, and the characteristics of amplitude-frequency response are deduced and analyzed mathematically. Aiming at the selection of partial matched filter length in the design of PMF-FFT capture system, this paper studies the influence of the change of partial matched filter length on several performance indexes, and gives the selection criteria of partial matched filter length. In this paper, the scallop and related losses in PMF-FFT algorithm are compensated in two ways: adding zero and adding window. Finally, the performance of the improved algorithm is analyzed, and it is proved that the improved algorithm has better performance than the original algorithm. At the same time, several performance indexes are proposed, which proves the superiority of the improved algorithm.

Good-Thomas PFA

Abstract: The additive FFT algorithms of the preceeding two chapters make no explicit use of the multiplicative structure of the indexing set. We will see how this multiplicative structure can be applied, in the case of transform size N = RS, where R and S are relatively prime, to design a FT algorithm, similar in structure to these additive algorithms, but no longer requiring the twiddle factor multiplication. The idea is due to Good [2] in 1958 and Thomas [8] in 1963, and the resulting algorithm is called the Good-Thomas Prime Factor algorithm (PFA).