Design of a systolic array system for linear state equations

The Gauss-Jordan algorithm and the matrix-vector multiplication-accumulation are chosen to solve this problem. For systematically designing the systolic arrays system, the dependence graph (DG) approach has to be extended. The two dependence graphs which represent two different but data-dependent process algorithms are first linked together. Tag bits are added to index nodes in this linked DG which will use to indicate the different functions to be executed in a single processor element (PE). By applying the conventional time-scheduling and node-assignment procedures on the DG with a tag, the interfacing communication problem of a systolic arrays system will be well solved and the control of the different functions of the PE can be distributed throughout the array. Based on this method, an optimal linear state solver has been designed successfully