EQUIVALENT TRANSFORMATIONS FOR SOME KINDS OF RECURSIVE NON-LINEAR COMPUTING STRUCTURES FOR EFFICIENT IMPLEMENTATION ON RECONFIGURABLE COMPUTER SYSTEMS

Abstract

In the paper, we consider data-equivalent transformations of some kinds of non-linear
computing structures, such as quadratic, fractional and conditional. All computing structures
contain feedbacks. If a pipeline computing structure of a task, implemented on a reconfigurable
computer system, contains feedbacks, the data processing rate slows down, because it is necessary
to wait for feedback results to calculate the next value. The processing rate slows down not
only in the chain with feedback, but in the whole computing structure. As a result, the task solution
time increases. Previous fragments have to delay their data to supply it into a chain with
feedback, and subsequent ones have to remain idle waiting for the feedback result data. At pr esent,
there are no software development tools for reconfigurable computer systems with automatic
optimization of such computing structures. So, the user has to analyze the source code to
find expressions with feedbacks, and to optimize them. As a result, the development time of eff icient
applications considerably increases. We suggest methods decreasing the data processing
time interval (down to unity in the best case) for applied tasks solved on reconfigurable computer systems. Besides, the task solution time also decreases. Owing to the suggested methods,
implemented in the optimizing synthesizer of circuit solutions, transformations are performed
automatically. As a result, the development time for efficient applied tasks with feedbacks decreases
from several days to several minutes.