Fast parallel implementation of DFT using configurable devices

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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(N2) additions and O(N) real multiplications with constant factors. Our design employes 2p + 1 PEs (1 ≤ p ≤ N), O(N) memory and fixed I/O with the host. It is scalable over p (1 ≤ p ≤ N) and can solve larger problems with the same hardware by increasing the memory. All the PEs have fixed architecture. Our implementation is faster than most standard DSP designs for FFT. It also outperforms other FPGA-based implementations for FFT, in terms of speed and adaptability to larger problems.

Cite

CITATION STYLE

APA

Dandalis, A., & Prasanna, V. K. (1997). Fast parallel implementation of DFT using configurable devices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1304, pp. 314–323). Springer Verlag. https://doi.org/10.1007/3-540-63465-7_236

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free