Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations
From MaRDI portal
Publication:1071504
DOI10.1016/0020-0190(85)90092-4zbMath0586.68033MaRDI QIDQ1071504
Imrich Vrt'o, Ondrej Sýkora, Pavol Ďuriš, Clark D. Thompson
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
complexity; discrete Fourier transform; VLSI; DFT; area of VLSI circuits; discrete Walsh-Hadamard transform; DWHT
68Q25: Analysis of algorithms and problem complexity
Related Items
Semelectivity is not sufficient, A minimum-area circuit for \(\ell\)-selection, On problem transformability in VLSI
Cites Work