Optimal VLSI architectures for multidimensional DFT
- 1 March 1989
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 265-272
- https://doi.org/10.1145/72935.72963
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- On problem transformability in VLSIAlgorithmica, 1987
- New lower bound techniques for VLSITheory of Computing Systems, 1984
- Multi-dimensional systolic networks, for discrete fourier transformPublished by Association for Computing Machinery (ACM) ,1984
- Fourier Transforms in VLSIIEEE Transactions on Computers, 1983
- The Area-Time Complexity of Binary MultiplicationJournal of the ACM, 1981
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981
- Information transfer and area-time tradeoffs for VLSI multiplicationCommunications of the ACM, 1980
- Direct fast Fourier transform of bivariate functionsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- The fast Fourier transform in a finite fieldMathematics of Computation, 1971
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965