Hardware architectures for the fast Fourier transform
Open Access
- 14 October 2018
- book chapter
- Published by Springer Nature
- p. 613-647
Abstract
No abstract availableKeywords
This publication has 95 references indexed in Scilit:
- An Optimum Architecture for Continuous-Flow Parallel Bit ReversalIEEE Signal Processing Letters, 2015
- Hardware Efficient Mixed Radix-25/16/9 FFT for LTE SystemsIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2014
- A 512-point 8-parallel pipelined feedforward FFT for WPAN2011
- An Efficient VLSI Architecture for Normal I/O Order Pipeline FFT DesignIEEE Transactions on Circuits and Systems II: Express Briefs, 2008
- On output reorder buffer design of bit reversed pipelined continuous data FFT architecture2008
- Some Optimizations of Hardware Multiplication by Constant MatricesIEEE Transactions on Computers, 2005
- An efficient multiplierless approximation of the fast Fourier transform using sum-of-powers-of-two (SOPOT) coefficientsIEEE Signal Processing Letters, 2002
- A survey of CORDIC algorithms for FPGA based computers1998
- Parallel architecture for fast transforms with trigonometric kernelIEEE Transactions on Parallel and Distributed Systems, 1994
- A pipelined FFT processor for word-sequential dataIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989