Fourier Transforms in VLSI
- 1 November 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-32 (11), 1047-1057
- https://doi.org/10.1109/tc.1983.1676155
Abstract
This paper surveys nine designs for VLSI circuits that compute N-element Fourier transforms. The largest of the designs requires O(N2 log N) units of silicon area; it can start a new Fourier transform every O(log N) time units. The smallest designs have about 1/Nth of this throughput, but they require only 1/Nth as much area.Keywords
This publication has 15 references indexed in Scilit:
- Minimum propagation delays in VLSIIEEE Journal of Solid-State Circuits, 1982
- A critique of network speed in VLSI models of computationIEEE Journal of Solid-State Circuits, 1982
- Area—time tradeoffs for matrix multiplication and related problems in VLSI modelsJournal of Computer and System Sciences, 1981
- Lower bounds for VLSIPublished by Association for Computing Machinery (ACM) ,1981
- Planar Circuit Complexity and The Performance of VLSI Algorithms +Published by Springer Nature ,1981
- Design of 2.5-Micrometer Josephson Current Injection Logic (CIL)IBM Journal of Research and Development, 1980
- Very Fast Fourier Transform Algorithms Hardware for ImplementationIEEE Transactions on Computers, 1979
- Generalized Connection Networks for Parallel Processor IntercommunicationIEEE Transactions on Computers, 1978
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971
- What is the fast Fourier transform?IEEE Transactions on Audio and Electroacoustics, 1967