Skip to main content
Conference Proceedings

Parallelization techniques for multidimensional hypercomplex discrete fourier transform

Lecture Notes in Computer Science (2005) 3606 413-419
DOI: 10.1007/11535294_36
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider techniques for parallelization of the multidimensional hypercomplex discrete Fourier transform. There are two potentials for parallel algorithm synthesis: specific structural properties of hypercomplex algebra and inner parallelism of multidimensional Cooley-Tukey scheme. Both approaches are developed; results of their experimental research are shown. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Chicheva, M., Aliev, M., & Yershov, A. (2005). Parallelization techniques for multidimensional hypercomplex discrete fourier transform. In Lecture Notes in Computer Science (Vol. 3606, pp. 413–419). Springer Verlag. https://doi.org/10.1007/11535294_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free