Lower bound of computational complexity and asymptotically fast algorithms of discrete fourier transforms on finite abelian groups

K. Egiazarian, J. Astola

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Translated title of the contributionLower bound of computational complexity and asymptotically fast algorithms of discrete fourier transforms on finite abelian groups
    Original languageEnglish
    Title of host publicationProceedings of ISPACS 2000, IEEE International Symposium on Intelligent Signal Processing and Communication Systems, November 5-8, 2000, Honolulu, Hawaii, USA
    Pages793-796
    Publication statusPublished - 2000
    Publication typeA4 Article in conference proceedings

    Publication forum classification

    • No publication forum level

    Cite this