Two VLSI Structures for the Discrete Fourier Transform
- 1 August 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-32 (8) , 750-754
- https://doi.org/10.1109/tc.1983.1676314
Abstract
Two VLSI structures for the computation of the discrete Fourier transform are presented. The first structure is a pipeline working concurrently on different transforms. It is shown that it matches, within a constant factor, the theoretical lower bounds for area versus data rate. The second structure is a simple modification of the first one; it works on a single transform at a time, and it matches within a constant factor the theoretical area-time lower bounds.Keywords
This publication has 9 references indexed in Scilit:
- Fourier Transforms in VLSIIEEE Transactions on Computers, 1983
- A combinatorial limit to the computing power of V.L.S.I. circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Information transfer and area-time tradeoffs for VLSI multiplicationCommunications of the ACM, 1980
- Greatest of the Least Primes in Arithmetic Progressions Having a Given ModulusMathematics of Computation, 1979
- Cost and performance of VLSI computing structuresIEEE Journal of Solid-State Circuits, 1979
- Area-time complexity for VLSIPublished by Association for Computing Machinery (ACM) ,1979
- A Class of Finite Computation Structures Supporting the Fast Fourier TransformPublished by Defense Technical Information Center (DTIC) ,1973
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971
- An Adaptation of the Fast Fourier Transform for Parallel ProcessingJournal of the ACM, 1968