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

DOI10.1016/0020-0190(85)90092-4zbMATH Open0586.68033OpenAlexW2002270678MaRDI QIDQ1071504FDOQ1071504

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Semelectivity is not sufficient
• A minimum-area circuit for \(\ell\)-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)