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.

DFT beamforming algorithms for space-time-frequency applications

Abstract: This work presents modified variants, in a recursive format, of the Kahaner's additive fast Fourier transform algorithm. The variants are presented in Kronecker products algebra language. The language serves as a tool for the analysis, design, modification and implementation of the FFT variants on re-configurable field programmable gate array computational structures. The target for these computational structures are discrete Fourier transform beamforming algorithms for space-time-frequency applications in wireless.

Restoring lost samples with boundary matched

Abstract: In various applications of speech transmission and processing there is always a possibility of loss of samples. The iterative algorithm of Papoulis-Gerchberg is famous algorithm for solving the lost samples recovery problem. The algorithm, however, is usually slowly convergent. This paper presents a new approach for restoring lost samples with preprocess for meeting boundary conditions of discrete Fourier transform (DFT) in the iteration of Papoulis-Gerchberg algorithm. The simulation indicates the mean square error (MSE) of the recovery and the convergence rate with the preprocess concept is much better and faster than that without preprocess concept.

Bounds on Error Due to Finite Arithmetic in FFT Computation

Abstract: For the decimation-in-frequency FFT algorithm using fixed point arithmetic, it is shown that there are position-dependent bounds on the error amplitude in the Fourier co-efficients. This means that the error statistics are position dependent and the earlier results on finite arithmetic effects in FFT calculation are inaccurate to that extent. These results lead to worst-case deterministic design of FFT processor.

A high-speed processor for finely-spaced Fourier transform via chirp z-transform

Abstract: This paper deals with the design of a processor for very-finely spaced spectral analysis over a narrow band of the available spectrum. The processor implements the chirp z-transform (CZT) algorithm, and exploits a fully-parallel architecture in order to address real-time applications with very-high throughput. The internal data-path is optimized as a trade-off between fixed-point accuracy and implementation complexity. The proposed architecture has been customized for the case study of a 64-point transform in a sub-band of 10% of the available spectrum, and has reached the astonishing throughput of 3.2 Gs/s on a Xilinx Virtex-IV FPGA. Also, compared with a customary approach based on FFT, a remarkable saving in complexity is shown.

Two-stage optimization of CORDIC-friendly FFT

Abstract: In this paper, authors extend the work of CORDIC-Friendly Fast Fourier Transform (FFT) architecture in [1]. Instead of optimizing each stage independently, a joint optimization of two stages of the CORDIC-Friendly FFT rotations is considered. At no additional hardware cost, the proposed scheme achieves up to 38 dB SQNR gain using two-iteration MSR-CORDIC when compared to the previous algorithm for different FFT lengths.