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

DOI10.1016/0020-0190(85)90092-4MaRDI QIDQ1071504zbMATH OpenOpenAlexFDO

Authors Pavol Ďuriš, Ondrej Sýkora, Clark D. Thompson, Imrich Vrt'o

Publication date 1985

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(85)90092-4

zbMATH Keywords

complexitydiscrete Fourier transformVLSIDFTarea of VLSI circuitsdiscrete Walsh-Hadamard transformDWHT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(3)

• Semelectivity is not sufficient
• A minimum-area circuit for -selection
• On problem transformability in VLSI

This page was built for publication: Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1071504)