A CLASS OF FINITE COMPUTATION STRUCTURES SUPPORTING THE FAST FOURIER TRANSFORM

Optimal VLSI architectures for multidimensional DFT

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures

Optimal VLSI architectures for multidimensional DFT (preliminary version)

ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures

The Area-Time Complexity of Binary Multiplication

Journal of the ACM (JACM)

Area-time complexity for VLSI

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

The chip complexity of binary arithmetic

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

Two VLSI Structures for the Discrete Fourier Transform

IEEE Transactions on Computers