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

DOI10.1016/0020-0190(85)90092-4zbMath0586.68033OpenAlexW2002270678MaRDI QIDQ1071504

Ondrej Sýkora, Pavol Ďuriš, 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)

Related Items (3)

A minimum-area circuit for \(\ell\)-selection ⋮ On problem transformability in VLSI ⋮ Semelectivity is not sufficient

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

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