New fast algorithm for two-dimensional discrete Fourier transform DFT(2<sup>n</sup>; 2) (Q3031888)

From MaRDI portal
scientific article
Language Label Description Also known as
English
New fast algorithm for two-dimensional discrete Fourier transform DFT(2<sup>n</sup>; 2)
scientific article

    Statements

    New fast algorithm for two-dimensional discrete Fourier transform DFT(2<sup>n</sup>; 2) (English)
    0 references
    0 references
    0 references
    1989
    0 references
    permutation
    0 references
    place
    0 references
    fast discrete Fourier transform
    0 references
    fast discrete cosine transform
    0 references
    algorithm
    0 references

    Identifiers

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