Skip to main content
SpringerLink
Log in

Parallelization Techniques for Multidimensional Hypercomplex Discrete Fourier Transform

  • Conference paper
Parallel Computing Technologies (PaCT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3606))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aliev, M.V., Chernov, V.M.: Two-dimensional FFT-like algorithms with overlapping. Optical Memory and Neural Networks (Information Optics) 11(1), 29–38 (2002)

    Google Scholar 

  2. Aliev, M.V.: Synthesis of two-dimensional DFT algorithms in the hypercomplex algebra. Pattern recognition and image analysis 13(1), 61–63 (2003)

    Google Scholar 

  3. Furman, Ya.A., Krevetskii, A.V., Peredreev, A.K.: An introduction to contour analysis: applications to image and signal processing. FIZMATLIT, Moscow (2002) (in Russian)

    Google Scholar 

  4. Sommer, G. (ed.): Geometric Computing with Clifford Algebra. Springer Series in Information Sciences. Springer, Berlin (2001)

    Google Scholar 

  5. Labunets, E.V., Labunets, V.G., Egiazarian, K., Astola, J.: Hypercomplex moments application in invariant image recognition. In: Int. Conf. on Image Processing, vol. 98, pp. 256–261 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Image Processing Systems Institute of the RAS, 443001, Molodogvardeiskaya st. 151, Samara, Russia

    Marina Chicheva

  2. Adygeya State University, 352700, Universitetskaya st. 208, Maikop, Adygeya Republic, Russia

    Marat Aliev

  3. Samara State University, 443011, Academik Pavlov st. 1, Samara, Russia

    Alexey Yershov

Authors
  1. Marina Chicheva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marat Aliev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexey Yershov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Novosibirsk State Technical University,  

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chicheva, M., Aliev, M., Yershov, A. (2005). Parallelization Techniques for Multidimensional Hypercomplex Discrete Fourier Transform. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2005. Lecture Notes in Computer Science, vol 3606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535294_36

Download citation

  • DOI: https://doi.org/10.1007/11535294_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28126-9

  • Online ISBN: 978-3-540-31826-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation