INTERLOCKING PROPERTIES OF THE LINEAR DATA DEPENDENCE METHOD
Marjan Gušev, David John Evans · International Journal of Parallel Emergent and Distributed Systems · 1996
We analyse the properties of linear transformations used in the Data Dependence method. Actually the Dependence Graph (DG) is mapped to a Space Time Graph (STG) with special properties. The transformation is valid if 4 conditions are satisfied: the timing condition, the space time condition, the regular data flow condition and the existence condition. The obtained STG has not been analysed in the literature previously. STG will have the special property interlocking translation. This property can be efficiently used to obtain the folding or the fast systolic design so the efficiency of the obtained systolic designs will be doubled. As an example, the interlocking translation and composition is implemented for the ARMA Biter, with many applications in modern digital signal processing. The H. T. Kung ARMA filter linear array uses 50% more communication links and the processors are twofold more complex than the new proposed implementation. The processors are utilized in every time step and no idle steps are required in the new fast systolic designs.