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.

Comments on "A High-Speed Algorithm for the Computer Generation of Fourier Transforms"

Abstract: The efficiency (in terms of both execution time and storage requirements) of a recently presented algorithm for computing the fast Fourier transform is compared to that of alternative algorithms.

The Discrete Fourier Transform, Part 3: The PSD

Abstract: This paper is part 3 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on computing the Power Spectral Density (PSD) of the FFT (Fast Fourier Transform) and the IFFT (Inverse Fast Fourier Transform). The implementation is based on a well-known algorithm, called the decimation in time Radix 2 FFT, and requires that its’ input data be an integral power of two in length. This paper demonstrates the computation of the PSD and applications of the DFT and IDFT. The applications include filtering, windowing, pitch shifting and the spectral analysis of re-sampling.

Low-power memory addressing scheme for fast fourier transform processors

Abstract: In this paper, a new memory addressing architecture is proposed for low-power radix-2 FFT implementations. Two optimization schemes are presented for dynamic power reduction. First, a multi-bank memory structure is introduced. Second, twiddle factor access times are significantly reduced with a new addressing sequence. For performance evaluation, FFT kernels with transform sizes ranging from 16 to 512 are implemented in CMOS 0.18µ technology. The synthesis results and architectural analysis indicate significant switching power reduction with no performance penalty. Power reduction factor grows with the transform size, making this architecture ideal for applications requiring long FFT operations.

OFDM transceiver design using C

Abstract: The aim of this paper is to design a baseband orthogonal frequency division multiplexing (OFDM) [1]-[2] transceiver including 8 point Fast Fourier Transform (FFT), 8 point Inverse Fast Fourier Transform (IFFT) [3] core processor, DPSK modulator[4], demodulator serial to parallel and parallel to serial converter blocks in C language. The main challenge is to derive the algorithm for Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT). There are many algorithms available that can implement FFT and IFFT.

Research on Inter-harmonic Detection Using Windows and Interpolated FFT Algorithm

Abstract: The inter-harmonics in power grid may cause negative influence on power quality and power supply reliability,so the accurate detecting of inter-harmonics is important for the stable operation of the power system.According to the inter-harmonics characteristics,based on the FFT algorithm,interpolation FFT algorithm was proposed to detect inter-harmonics.Through the analysis of the characteristics of different window functions,Hanning window is selected as the analysis window,and the window-length and the sampling period are determined,which can detect harmonics and inter-harmonics accurately.Besides,FFT algorithm and interpolation FFT algorithm are simulated by MATLAB.By contrasting and analyzing the estimated results of frequency and amplitude,it can be seen that the windows and interpolated FFT algorithm can detect harmonics and inter-harmonics of a given signal much more accurately.