Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations (Q1071504): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q244510
Property / author
 
Property / author: Imrich Vrt'o / rank
Normal rank
 

Revision as of 02:06, 12 February 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
    0 references
    0 references
    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
    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