Summary: Efficient Implementation of FFT­Like Algorithms on
MIMD Systems
Michael N ¨
OLLE and Nils JUNGCLAUS \Lambda
Technische Informatik I, Technische Universit¨at Hamburg­Harburg, D--21071 Hamburg,
Tel/Fax: +49 [40] 7718 2795 / 7718 2911, E­Mail: noelle@tu­harburg.d400.de
\Lambda AG Technische Fakult¨at, Universit¨at Bielefeld, Universit¨atsstraße 1, D--33615 Bielefeld,
Tel: +49 [521] 106 6059, E­Mail: nils@techfak.uni­bielefeld.de
In M.J.J. Holt et al., editor, Proceedings of EUSIPCO­94, 7. Europ. Sign. Proc. Conf., volume III,
pages 1625­­1628, Edinburgh, Scotland, September 1994. EURASIP, Lausanne.
1 Introduction
In this paper we investigate parallel implementations of
the well known two­dimensional Fast Fourier Transform
(FFT) algorithm. 1 The FFT may be taken as a key algo­
rithm representing a wide class of algorithms used in im­
age processing and pattern recognition that are realized
with a similar algorithmic structure. Examples within
this class include the fast Walsh transform, translation­
invariant transforms for position invariant feature ex­
traction in gray scale images, fast parallel sorting, etc.

Source: Albert-Ludwigs-Universität Freiburg, Institut für Informatik,, Lehrstuhls für Mustererkennung und Bildverarbeitung

Collections: Computer Technologies and Information Sciences