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.
CITATION STYLE
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
Mendeley helps you to discover research relevant for your work.