[ News | IPCA | Mirrors | Add | Search | Mail | Help | WoTUG ]
Abstract: A Generalized alogrithm has been derived for the execution of the Cooley-Tukey FFT algorithm on a distributed memory machine. This algorithm is based on an approach that combines a large number of butterfly operations into one large process per processor. The performance can be predicted from theory. The actual algorithm has been implemented on a transputer array, and the performance of the implementation has been measured for various sizes of the complex input vector. It is shown that the algorithm scales linearly with the number of transputers and the problem size.
Authors: Herman Roebbers, University of Twente, The Netherlands; Peter Welch, University of Kent at Canterbury, UK and Klaas Wijbrans, Van Rietschoten & Houwens, The Netherlands.
Abstract: The design of a control system is not finished with the derivation of the necessary control algorithms. When the controller is implemented in a digital computer, the system designed has to schedule all control and calculation tasks within the sampling interval of the system. Higher sampling frequencies often improve system performance. On the other hand, more sophisticated control algorthims require more computing time thus reducing the obtainable sampling frequencies. Therefore, it is important to minimise the overhead of sampling and communications. This paper describes a transputer-baseed I/O system fulfilling this requirement and shows how the sampling with this system is done.
Authors: M.H. Schwirtz, Mechatronics Research Centre Twente and Control Laboratory, Department of Electrical Engineering, University of Twente, Netherlands; K.C.J. Wijbrans; A.W.P. Bakkers; E.P. Hoogzaad and R.Bruis.