This page illustrates the principles of the Xputer paradigm. To view the animation you need the plugin Shockwave from Macromedia. The size of this animation is only 20KB, therefore the time to download should be short. The purpose of this page is to illustrate the importance of using data sequencers (instead of an instruction sequencer).
As an example the Fast Fourier Transformation is chosen. We are aware that the animation does not really show a Fast Fourier Transformation, but only the principles. The way of execution correlates the Fast Fourier Transformation.
For simplicity the operations are shown in sequence. Usually the executions of an Xputers are pipelined.
To control the animation there are 3 buttons and a slider.
Explanation of the animation.
The animation starts, with filling the data memory with random numbers. For calculations three scan windows are required. The large 2-by-2 scan window holds the input data and the two 1-by-1 scan windows store the results after calculations. For Fast Fourier Transformation the follwing formulas have to be computed:
x1 = a + w * b
x2 = a - w * b
Obviously the term (w*b) is only computed once. The follwing describes the sequence of animated steps:
These steps are iterated until the computation of the Fast Fourier Transformation is complete.
For further information please refer to the related FAQ-Page or to:
A. Ast, J. Becker, R.W. Hartenstein, et. al.: Data-procedural Languanges for FPL-based Machines; 4rd Int. Workshop On Field Programmable Logic And Applications, FPL'94, Prague, September 7-10, 1994, Lecture Notes in Computer Science, Springer, 1994.
needed for this animation.
© Copyright 1997, Xputer Laboratory, University of Kaiserslautern, Kaiserslautern, Germany - Webmaster