Elsevier

Information Processing Letters

Volume 21, Issue 5, 18 November 1985, Pages 245-247
Information Processing Letters

Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations

https://doi.org/10.1016/0020-0190(85)90092-4Get rights and content

Abstract

We prove tight linear lower bounds on the area of VLSI circuits for the problems of discrete Fourier and Walsh-Hadamard transformations of n k-bit elements.

References (6)

  • B. Chazelle et al.

    Optimality in VLSI

  • C.D. Thompson

    Area-time complexity for VLSI

  • J.E. Savage

    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)

View all citing articles on Scopus

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.

View full text