\input zb-basic
\input zb-ioport
\iteman{io-port 00919522}
\itemau{Yanushkevich, S.N.}
\itemti{Systolic synthesis algorithms for arithmetic polynomial forms of $k$-valued functions of Boolean algebra.}
\itemso{Autom. Remote Control 55, No.12, Pt. 2, 1812-1823 (1994); translation from Avtom. Telemekh. 1994, No.12, 128-142 (1994).}
\itemab
From the text: In this work we suggested ways of solving the problem of mapping the algorithms designed to process $k$-valued data given in the form of arithmetic polynomials into the architecture of parallel computing devices. In solving this problem, we single out two stages. The first stage involves formalizing the arithmetic polynomial synthesis problem at the matrix level (direct problem) and restoring the $k$-valued function by means of the synthesized polynomial (inverse problem). The second stage calls for a more flexible adaptation to hardware and software at the expense of changing the character of the entrance of variables to an arithmetic polynomial. We illustrated the solution of this problem by the example of systolic arrays of linear type, which are the simplest ones regarding their construction by the VLSI technology. But the algorithms obtained are also suitable for their implementation with the use of other architectures and standard packages of programs. In total, these actions constitute a working tool for solving a wide class of applied problems by the methods of the algebra of $k$-valued functions without restrictions on the number $k$ of values (logic polynomial forms are set only for a prime number $k$ or for the extension of the field $k^t$. Reviewer's remark: The author seems unaware of the important monogrpah by {\it M. Davio}, {\it J.-P. Deschamps} and {\it A. Thayse}, Discrete and switching functions (1978; Zbl 0385.94020).
\itemrv{S.Rudeanu (Bucure\c{s}ti)}
\itemcc{}
\itemut{direct problem; inverse problem; arithmetic polynomial synthesis problem; $k$-valued function; systolic arrays of linear type; VLSI; algorithms}
\itemli{}
\end