Abstract
The paper presents a recursive method for computation of 2DFT for rectangular matrices that decreases the number of complex multiplications and leads to very effective implementation on computers with SIMD architecture. The matrix is in every step divided into four submatrices that are processed in parallel. Rapid reduction of multiplications makes this method attractive also for sequential computation.The algorithm was implemented on MasPar MP-1 computer and the time measurements are involved.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work has been done in frame of the common project ”Parallel Algorithms for SIMD Architectures” of the Institute for Statistics and Informatics,University of Vienna and Control Theory and Robotics,Bratislava,Slovak Republic
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
E.Oran Brigham:The Fast Fourier Transform and Its Applications,Prentice-Hall,1988, pp.240–254
A.Huebner,R.Klette:Zur Parallelen Ausfuehrung der Schnellen Fourier Transformation fuer NxN Matrizen, Wiss.Zeitschr.,F.Schiller-Univ.Jena,1980,H.2,pp.251–261
Hans Munthe-Kaas:Super Parallel FFT's,Report No.52,May 1991,Department of Informatics, University of Bergen,Hoyteknologisenteret,N-5020 Bergen
M.Vajtersic:Modern Algorithms for Solving Some Elliptic Problems,Veda Bratislava,1988(in Slovak)
M.Lucka:Two-dimensional Fourier Transform,Proceedings Library of Algorithms VI., Algorithms'81,High Tatras(in Slovak)
MasPar Programming Language User Guide,Software Version 3.0,Revision:A2,July 1992, MasPar Computer Corporation
MasPar Fortran Reference Manual,Software Version 2.0,MasPar Computer Corporation Sunnyvale,California,July 1992
J.Dongarra at all:Vector and Parallel Computing,Issues in Applied Research and Development,Elis Horwood Series in Computers and Their Applications,1989,pp.153–161,V.E.Henson: Parallel Compact Symmetric FFT's
Hans Munthe-Kaas:Practical Parallel Permutation Procedure,Dep.of Informatics, University of Bergen,N-5020 Norway,Support for the Lectures in Course ”Parallel Algorithms”, 1992
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lucka, M. (1993). An effective algorithm for computation of two-dimensional fourier transform for NxM matrices. In: Volkert, J. (eds) Parallel Computation. ACPC 1993. Lecture Notes in Computer Science, vol 734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57314-3_6
Download citation
DOI: https://doi.org/10.1007/3-540-57314-3_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57314-2
Online ISBN: 978-3-540-48055-6
eBook Packages: Springer Book Archive