Optimal VLSI architectures for multidimensional DFT

Authors:
G. Bilardi;S. W. Hornick;M. Sarrafzadeh
Affiliations:
Department of Computer Science, Upson Hall, Cornell University, Ithaca, NY;Andersen Consulting, Center for Strategic Tech. Res., 100 S. Wacker, Chicago, IL;Dept. of Elec. Eng. and Comp. Sci., The Technological Institute, Northwestern University, Evanston, IL
Venue:
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Year:
1989

Citing 10
Cited 3

VLSI Architectures for multidimensional fourier transform processing

IEEE Transactions on Computers
The Area-Time Complexity of Binary Multiplication

Journal of the ACM (JACM)
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Information transfer and area-time tradeoffs for VLSI multiplication

Communications of the ACM
Multidimensional Digital Signal Processing

Multidimensional Digital Signal Processing
Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Area-time complexity for VLSI

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Multi-dimensional systolic networks, for discrete fourier transform

ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
A CLASS OF FINITE COMPUTATION STRUCTURES SUPPORTING THE FAST FOURIER TRANSFORM

A CLASS OF FINITE COMPUTATION STRUCTURES SUPPORTING THE FAST FOURIER TRANSFORM
A complexity theory for VLSI

A complexity theory for VLSI

VLSI Architectures for Multidimensional Transforms

IEEE Transactions on Computers
Optimal VLSI Networks for Multidimensional Transforms

IEEE Transactions on Parallel and Distributed Systems
New area-time lower bounds for the multidimensional DFT

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119

Quantified Score

Hi-index	0.00

Visualization

Abstract