An architecture for a VLSI FFT processor*
References (14)
- et al.
The chip complexity of binary arithmetic
- et al.
An algorithm for the machine calculation of complex Fourier series
Math. Comput.
(1965) Very fast Fourier transform algorithms for hardware implementation
IEEE Trans Comput.
(1979)- et al.
VLSI implementation of digital Fourier transforms
- et al.
A model of computation for VLSI with related complexity results
- et al.
VLSI complexity with reduced hardware
- et al.
VLSI sorting with reduced hardware
There are more references available in the full text version of this article.
Cited by (13)
Efficient parallel computations on the reduced mesh of trees organization
1994, Journal of Parallel and Distributed ComputingAn efficient VLSI architecture with applications to geometric problems
1989, Parallel ComputingFEATURE-BASED DELAY LINE USING REAL-TIME CONCATENATIVE SYNTHESIS
2023, Proceedings of the International Conference on Digital Audio Effects, DAFxVLSI implementation of Balanced Binary Tree Decomposition based 2048-point FFT/IFFT processor for mobile WI-Max
2010, Proceedings - 3rd International Conference on Emerging Trends in Engineering and Technology, ICETET 2010An area efficient and low power implementation of 2048 point FFT/IFFT processor for mobile WiMAX
2010, 2010 International Conference on Signal Processing and Communications, SPCOM 2010Long-point FFT processing based on twiddle factor table reduction
2007, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- *
This research has been supported by the U.S. Army Research Office, Contract No. DAAG29-82-K-0110 and U.S. Office of Naval Research, Contract No. N00014-80-C-0517.
- **
Now with the Department of Electrical Engineering, University of Maryland, College Park, MD 20742, U.S.A.
Copyright © 1983 Published by Elsevier B.V.