Pipeline FFT Architectures Optimized for FPGAs

Abstract

This paper presents optimized implementations of two different pipeline FFT processors on Xilinx Spartan-3 and Virtex-4 FPGAs. Different optimization techniques and rounding schemes were explored. The implementation results achieved better performance with lower resource usage than prior art. The 16-bit 1024-point FFT with the R2 2 SDF architecture had a maximum clock frequency of 95.2 MHz and used 2802 slices on the Spartan-3, a throughput per area ratio of 0.034 Msamples/s/slice. The R4SDC architecture ran at 123.8 MHz and used 4409 slices on the Spartan-3, a throughput per area ratio of 0.028 Msamples/s/slice. On Virtex-4, the 16-bit 1024-point R2 2 SDF architecture ran at 235.6 MHz and used 2256 slice, giving a 0.104 Msamples/s/slice ratio; the 16-bit 1024-point R4SDC architecture ran at 219.2 MHz and used 3064 slices, giving a 0.072 Msamples/s/slice ratio. The R2 2 SDF was more efficient than the R4SDC in terms of throughput per area due to a simpler controller and an easier balanced rounding scheme. This paper also shows that balanced stage rounding is an appropriate rounding scheme for pipeline FFT processors.

Towards a highly flexible spectrum sensing platform for cognitive radio networks

“…A radix-4 Single-path Delay Commutator (SDC) pipelined FFT was used, known to utilize less multipliers, with the drawback of occupying more memory on the FPGA. This approach is comparable to other FFT implementations in [15].…”

SFF—The Single-Stream FPGA-Optimized Feedforward FFT Hardware Architecture

“…In the literature one can also find numerous publications that consider the implementation of single-stream FFTs in FPGAs, e.g. [1,5,17,19,25,26]. However, there has not been much research performed on the architectural level on FFT with the particular aspect of FPGA-mapping in consideration.…”

A Low Multiplicative Complexity of Proposed FFT/IFFTs Design Applied for OFDM-Based Wireless Communication Systems

“…The Fast Fourier transforms (FFT) and its inverse (IFFT) is one of the fundamental algorithms in the field of digital signal processing [1], [2]. The FFT/IFFT is widely used in various areas such as telecommunications, speech and image processing, etc.…”

“…To meet those criterions, the FFT/IFFT design has to employ a highly in-depth architecture or use a very high operation frequency. One solution will satisfy the timing constraint, but at the cost of other constraints: the area and power consumption [1], [4].…”