The multiplicative complexity of the discrete Fourier transform (Q1060552)

From MaRDI portal





scientific article; zbMATH DE number 3907733
Language Label Description Also known as
English
The multiplicative complexity of the discrete Fourier transform
scientific article; zbMATH DE number 3907733

    Statements

    The multiplicative complexity of the discrete Fourier transform (English)
    0 references
    1984
    0 references
    We show how to compute the multiplicative complexity of the discrete Fourier transform on any set of data points.
    0 references
    minimal algorithms
    0 references
    multiplicative complexity
    0 references
    discrete Fourier transform
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references