Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations☆
References (6)
- et al.
Optimality in VLSI
Area-time complexity for VLSI
Planar-circuit complexity and the performance of VLSI algorithms
There are more references available in the full text version of this article.
Cited by (10)
Semelectivity is not sufficient
1991, Information Processing LettersPicture processing: 1986.
1987, Computer Vision, Graphics, & Image ProcessingNew area-time lower bounds for the multidimensional DFT
2011, Conferences in Research and Practice in Information Technology SeriesEfficient Network Folding Techniques for Routing Permutations in VLSI
1995, IEEE Transactions on Very Large Scale Integration (VLSI) SystemsOptimal VLSI Networks for Multidimensional Transforms
1994, IEEE Transactions on Parallel and Distributed SystemsOptimal Unified Architectures for the Real-Time Computation of Time-Recursive Discrete Sinusoidal Transforms
1994, IEEE Transactions on Circuits and Systems for Video Technology
- ☆
This work was supported in part by the National Science Foundation under Grant ECS-84-06408 and by the Institute of Technical Cybernetics of the Slovak Academy of Sciences.
Copyright © 1985 Published by Elsevier B.V.