A new set of minimum-add small-n rotated DFT modules (Q1098609)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A new set of minimum-add small-n rotated DFT modules
scientific article

    Statements

    A new set of minimum-add small-n rotated DFT modules (English)
    0 references
    0 references
    1988
    0 references
    This self-sorting, in-place FFT (fast Fourier transform) on complex data consists of small discrete Fourier transform modules dealing with mutually prime number of data and with an optional rotation of the results. This algorithm requires almost the same number of mathematical operations as that in Winograd's algorithm, although the number of additions is reduced in some cases.
    0 references
    self-sorting, in-place Fourier transform
    0 references
    discrete Fourier transform
    0 references
    mutually prime number of data
    0 references
    algorithm
    0 references
    Winograd's algorithm
    0 references

    Identifiers