Recursive Folding For Thel Efficiency Improvement Of Systolic Arrays - Part Ilj
Gabriel Okša, David John Evans · International Journal of Computer Mathematics · 1996
In this paper, the general theory of Recursive Folding developed in [1] is extended to the description of transformation of diagonal links. This type of link is present, for ixample, in the 2D hex systolic array for matrix-matrix multiplication [3]. By using the results derived in [1] and in this paper, the number of processors in the 2D-hex systolic array is reduced by about 33% as compared with [2], and the time complexity is the same.