Lower and upper bounds of SIMD-complexity for a family of Fourier-like transforms

D. Gevorkian, S. Agaian, J. Astola

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientific

    Translated title of the contributionLower and upper bounds of SIMD-complexity for a family of Fourier-like transforms
    Original languageEnglish
    Title of host publication11th IASTED International Conference on Parallel and Distributed Computing and Systems, November 3-6, 1999, Cambridge Massachusetts, USA
    Pages6 s
    Publication statusPublished - 1999
    Publication typeB3 Non-refereed article in conference proceedings

    Publication forum classification

    • No publication forum level

    Cite this