Hardware architectures for the fast fourier transform

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

Abstract

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 applications in terms of performance, circuit area, and/or power consumption. This chapter summarizes the research on FFT hardware architectures by presenting the FFT algorithms, the building blocks in FFT hardware architectures, the architectures themselves, and the bit reversal algorithm.

Cite

CITATION STYLE

APA

Garrido, M., Qureshi, F., Takala, J., & Gustafsson, O. (2018). Hardware architectures for the fast fourier transform. In Handbook of Signal Processing Systems (pp. 613–647). Springer International Publishing. https://doi.org/10.1007/978-3-319-91734-4_17

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