Energy-efficient and parameterized designs for fast Fourier transform on FPGAs
نویسندگان
چکیده
In this paper, we develop energy efficient designs for the Fast Fourier Transform (FFT) on FPGAs. Architectures for FFT on FPGAs are designed by investigating and applying techniques for minimizing the energy dissipation. Architectural parameters such as degrees of vertical and horizontal parallelism are identified and a design domain is created through a combination of design choices. We determine design trade-offs using high-level performance estimation to obtain energy-efficient designs. We implemented a set of parametrized designs having parallelism, radix and choice of storage types as parameters, on Xilinx Virtex-II FPGA to verify the estimates. Our designs dissipate 57% to 78% less energy than the optimized designs from the Xilinx library. In terms of a comprehensive metric such as EAT (Energy-Area-Time), our designs offer performance improvements of 3-13x over the Xilinx designs.
منابع مشابه
High throughput energy efficient multi - FFT architecture on FPGAs ( Draft ) ∗
To process high-rate streaming data, throughput is one of the key performance metrics for FFT design. However, high throughput FFT architectures consume large amount of power due to complex routing or excessive memory access. In this paper, we propose a Cooley-Turkey algorithm based, high throughput energy-efficient multi-FFT architecture. In the proposed architecture, we use multiple time-mult...
متن کاملC-LSTM: Enabling Efficient LSTM using Structured Compression Techniques on FPGAs
Recently, significant accuracy improvement has been achieved for acoustic recognition systems by increasing the model size of Long Short-Term Memory (LSTM) networks. Unfortunately, the everincreasing size of LSTMmodel leads to inefficient designs on FPGAs due to the limited on-chip resources. The previous work proposes to use a pruning based compression technique to reduce themodel size and thu...
متن کاملFast Parallel Implementation of DFT
In this paper we propose a fast parallel implementation of Discrete Fourier Transform (DFT) using FPGAs. Our design is based on the Arithmetic Fourier Transform (AFT) using zero-order interpolation. For a given problem of size N, AFT requires only O(N 2) additions and O(N) real multiplications with constant factors. Our design emploies 2p + 1 PEs (1 p N), O(N) memory and xed I/O with the host. ...
متن کاملA Review of Application of Signal Processing Techniques for Fault Diagnosis of Induction Motors – Part I
Abstract - Use of efficient signal processing tools (SPTs) to extract proper indices for fault detection in induction motors (IMs) is the essential part of any fault recognition procedure. The Part1 of the two parts paper focuses on Fourier-based techniques including fast Fourier transform and short time Fourier transform. In this paper, all utilized SPTs which have been employed for fault fete...
متن کاملDynamically Reconfigurable Constant Multiplication on FPGAs
Multiplication with constants is one of the most important operations in digital signal processing including digital filters and linear transformations like the fast Fourier transform. Runtime reconfiguration of the multiplied coefficients, also called reconfigurable single constant multiplication (RSCM), is an efficient method to reduce resources by time-multiplexing and resource sharing. Ther...
متن کامل