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.

Method supporting 4375-point and 3780-point FFT/IFFT and processor thereof

Abstract: The invention relates to a method supporting 4375-point and 3780-point FFT/IFFT and a parallel high performance processor. In the first layer of the FFT / IFFT, the prime factor algorithm is used to resolve 4375 points and 3780 points to completely eliminate twiddle factors of the first level. The same WFTA algorithm is applied to a bottom layer to complete 5-point and 7-point DFT calculation required in 4375-point, and 3-point, 4-point, 5-point and 7-point DFT calculation required in 3780-point. A matched two-dimensional memory array and an address generation unit that has no conflicting mapping relationship are designed; data can be read with a high degree of parallelism and written back strictly following the same address addressing mode in operations of all levels. The present invention enables the processor to support FFT / IFFT transformations of two different prime points with the same hardware resources and obtain high data throughput and improve the performance of the DTMB receiving system.

A performance-efficient and datapath-regular implementation of modified split-radix fast Fourier transform

Abstract: Discrete Fourier transform (DFT) finds various applications in signal processing, image processing, artificial intelligent, and fuzzy logic etc. DFT is often computed efficiently with Fast Fourier transform (FFT). The modified split radix FFT (MSRFFT) algorithm implements a length-N=2 m DFT achieving a reduction of arithmetic complexity compared to split-radix FFT (SRFFT). In this paper, a simplified algorithm is proposed for the MSRFFT algorithm, reducing the number of real coefficients evaluated from 5/8N − 2t o 15/32N − 2 and the number of groups of decomposition from 4 to 3. A implementation approach is also presented. The approach makes data-path of the MSRFFT regular similar to that of the radix-2 FFT algorithm. The experimental results show that (1) MSRFFT consumes less time on central processing units (CPUs) with sufficient cache than existing algorithms; (2) the proposed implementation method can save execution time on CPUs and general processing units (GPUs).

Implementation of fast fourier transform on FPGA

Abstract: The characteristics of FFT calculation are analyzed and applied to the design of high-speed immediate FFT calculation with FPGA adopted. The problems of overflow, double address and control over sequencing are well solved by Radix-4 algorithm and Ping-pong RAM. 1 024-point FFT calculation is finally implemented in 200 μs, and the requirement of high-speed and real-time is fulfiled.

An enhanced model for software realisation of recursive prime radix discrete Fourier transform

Abstract: An enhanced model is proposed for a software realization of the recursive prime radix algorithms used for computing the discrete Fourier transform. It is shown that a very efficient in-place, in-order prime factor mapping (PFM) addressing scheme can best be applied to the model. In this scheme, a single mapping equation is used for both data loading and data retrieval, hence no extra unscrambling process is required. The authors propose the use of a form of two parallel recursive digital filters for the computation of each short-length DFT (discrete Fourier transform). A significant improvement in speed is thereby achieved. This algorithm has been realized using Fortran 77 language with the IBM PC AT. Results of the realization show that the proposed software computation model can achieve a 44% speed improvement over the radix-2 FFT (fast Fourier transform) algorithm, whereas the code length is comparable. As compared with the prime factor algorithm, it has a similar, if not better, speed performance for medium-length DFT computations. However, the code length is much shorter. This approach has the advantage of a large choice of sequence lengths, unlike the FFT algorithms. >

A Novel Approach of Implementing an FFT Algorithm on OFDM System

Abstract: In this paper, we make insightful assessment of the computational performance of orthogonal frequency division multiplexing (OFDM) system in terms of complex calculations required using different Fourier transform techniques. We briefly introduce the different transform technique, viz. discrete Fourier transform (DFT) and various types of fast Fourier transform (FFT) as 2-radix FFT, 4-radix FFT etc. We have also discussed about a new FFT approach that can be applied in an OFDM system and shown comparison of it with other FFT techniques.