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.

On a fast algorithm for the approximate solution of the discrete Wiener-Hopf equation and an estimation of the accuracy

Abstract: A fast algorithm for the approximate solution of the discrete Wiener-Hopf equation is described and convergence rate estimates are obtained. The numerical algorithm is constructed by using the discrete Fourier transformation.

A Heterogeneous Hypercube Based On Strengthened Nodes For A Fast Processing Of SAR Raw-data

Abstract: A family of high performance processing elements has been conceived to implement flexible multiprocessor structures for real-time applications. The floating-point capabilities of the INMOS transputer components (T222-T805) have been improved, by using the AT&T floating-point Digital Signal Processors (DSP32-DSP32C), allowing to achieve up to 25 MFLOPS, 30 MIPS. In the paper, the design of a single board T800/DSP-32C based is presented and the simulation results of its specialization in signal processing applications are also reported. A comparative test between the traditional Cooley-Tukey FFT Algorithm (aA) and the Prime Factor Algorithm (PFA) shows that a 4096 complex points radix 4-CTA takes 16.6 ms. while for a 5040 complex points PFA about 32.3 ms are needed. A flexible development system has been also realized to allow a careful design of various "Strengthened Nodes", since it can be used as test-bed to compare the performance of different DSPs available on the market, when they are connected to components of the transputer family. "Strengthened Nodes" will be used in heterogeneous multiprocessor structures specialized for Synthetic Aperture Radar (SAR) data processing.

Research on Algorithm of Phase Difference Analysis Based on an Improved Windowed FFT

Abstract: Based on the small scale power system frequency fluctuation frequency leakage problems due to the FFT phase measurement error problem, this paper presents a high accuracy algorithm for phase difference measurement based on windowed discrete Fourier transform, the signal truncated using 4 order Blackman-Harris window, and corrects the phase correction method for discrete spectrum thus to calculate the phase difference. The algorithm for phase difference measurement theory and signal frequency independent, so there is no need to sample the signals of the whole cycle. A simple algorithm, less calculation, high precision, has strong inhibition on the harmonic and noise, simulation results verify the feasibility and effectiveness of the algorithm.

New Fast Fourier Transform with Linear Multiplicative Complexity

Abstract: In this paper, we introduced a new fast Fourier transform algorithm with linear multiplicative complexity for real and complex input signals. The proposed algorithm also reduces the total number of operations (arithmetic complexity, or the number of multiplications and additions) compared to the existing methods, such as Duhamel, Heideman, Burrus, Bi et al., Bouguezel et al

Fixed point FFT algorithm realization in OFDM channel estimation

Abstract: In this paper, four schemes for the fixed point Fast Fourier transform (FFT) algorithm are discussed. Comparisons are made in tradeoff between accuracy and complexity. Several results are obtained through simulation. First, the fixed point schemes given by Welsh and Int-FFT (Integer FFT) scheme by S. Oraintara are compared. Also, the upper bound given by Welsh is tested. Second, based on the comparison, two different methods are chosen for OFDM channel estimation. Our contribution here is that we use two different schemes to perform IFFT and FFT separately. Before being put into implementation, a little change in the fixed-point scheme is made. Last, mean squared errors (MSE) are compared between the float point channel estimation algorithm for OFDM systems and its fixed-point counterpart. The simulation result shows that these two performances are almost the same above 14-bit data quantization. In the paper, accuracy is the main concern and radix-2 is in use.