Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations (Q1071504): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(85)90092-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002270678 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3691061 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3326832 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4190126 / rank | |||
Normal rank | |||
Latest revision as of 13:04, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations |
scientific article |
Statements
Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations (English)
0 references
1985
0 references
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.
0 references
discrete Fourier transform
0 references
discrete Walsh-Hadamard transform
0 references
complexity
0 references
DFT
0 references
DWHT
0 references
VLSI
0 references
area of VLSI circuits
0 references
