The field of pipelined FFT hardware architectures has been studied during the last 50 years.
This paper is a survey that includes the main advances in the field related to architectures for …

In this brief, we present the CORDIC II algorithm. Like previous CORDIC algorithms, the
CORDIC II calculates rotations by breaking down the rotation angle into a series of …

This brief presents a new energy efficient Fast-Fourier Transform (FFT) architecture for real-
valued applications. The proposed architecture decimates the FFT in time domain with bit …

This paper explores new advanced quantization schemes for fast Fourier transform (FFT)
architectures. In previous works, FFT quantization has been treated theoretically or with the …

In this paper, we present new feedforward FFT hardware architectures based on rotator
allocation. The rotator allocation approach consists in distributing the rotations of the FFT in …

The fast Fourier transform (FFT) is a widely used algorithm in signal processing applications.
FFT hardware architectures are designed to meet the requirements of the most demanding …

In this paper, we present the first implementation of a 1 million-point fast Fourier transform
(FFT) completely integrated on a single field-programmable gate array (FPGA), without the …

This paper presents the fastest fast Fourier transform (FFT) hardware architectures so far.
The architectures are based on a fully parallel implementation of the FFT algorithm. In order …

In this brief, we propose a novel approach to implement multiplierless unity-gain single-
delay feedback fast Fourier transforms (FFTs). Previous methods achieve unity-gain FFTs by …

As silicon technology advances, field programmable gate arrays appear to gain ground
against the traditional ASIC project starts, reaching out to form the mainstream …