Two‐parallel pipelined fast Fourier transform processors for real‐valued signals

Abstract

This paper presents a set of novel two-parallel pipelined fast Fourier transform architectures for discrete Fourier transform computation of real-valued signal. The previous approaches of designing real-valued fast Fourier transform (RFFT) architectures are the attempts made to make the data path real. Some of the previous designs have partial real data paths (only first two stages are real), whereas the other designs have complete real data-paths, but reordering registers are required to bring the real and imaginary parts in parallel. Hence, these approaches reduce the number of registers and butterflies only to some extent in the RFFT design. In the proposed designs, feedback-based scheduling structures are introduced, which reduce the number of registers to half in several stages when compared with the previously known designs. Therefore, the proposed designs require 30% less area and 31.5% less power than the prior designs.

FPGA Implementation of Radix-2 based FFT Architecture for Real-Valued signal processing

“…The multi path delay commutator has been used for processing the FFT computation for two independent data streams. Here the bit reversal implementation is performed by the architecture itself by reusing shift registers by interleaving of data [8]. This paper briefly describes about the 2-parallel 16-point architecture 1, 2-parallel 16-point architecture 2, 4-parallel 16-point architecture and 4-parallel 64-point pipelined architectures based on radix-2, radix-2 2 and radix-2 3 algorithm.…”