A block algorithm for the algebraic path problem and its execution on a systolic array

The solution of the algebraic path problem (APP) for arbitrarily sized graphs by a fixed-size systolic array processor (SAP) is addressed. The APP is decomposed into two subproblems, and SAP is designed for each one. Both SAPs combined produce a highly implementable versatile SAP. The proposed SAP has p*p processing elements (PEs) solving the APP of an N-vertex graph in N/sup 3//p/sup 2/+N/sup 2//p+3p-2 cycles. With slight modifications in the operations performed by the PEs, the problem is optimally solved in N/sup 3//p/sup 2/+3p-2 cycles.Peer ReviewedPostprint (published version

Temporal unpredictability detection of real-time video sequence

Imperial Users onl

Design and implementation of a systolic array to solve the Algebraic Path Problem with the specific instance of the transistive and reflexive closure of a binary relation

The Algebraic Path Problem (APP) has many practical instances to be solved. The general solution by Robert and Trystram (1986) will be discussed along with the mapping and operation of the algorithm to a systolic array. The specific instance of the APP, the transistive and reflexive closure of a binary relation, will be implemented with a discussion of the different stages ranging from the logic equations to a method of the fabrication