Systolic and holographic pyramidical soft-systolic designs for successive matrix powers (Q1119336)

The problem of computing the powers \(A^ k\) of a matrix A, where \(k=2^ s\), \(s=1,2,..\). is solved on a systolic network. The techniques developed for multiplication of band matrices are adopted and a systolic array with hexagonal elements is used as a basic design component. The systolic designs based on respectively tree and pipeline of hexagonal arrays are depicted and analyzed from the point of view of the input-area and structure requirements. A ``soft-systolic'' design is shown finally, where the pyramid of arrays is considered. The data routing in the structures is unidirectional, i.e. analogical routing pattern of data can be used in the next squaring operation. However, such requirements occur in the later design (e.g. folding an array along its diagonal in a pyramid with successive layers of arrays) which are far from the realization in current practice currently. Nevertheless, the designs presented can be challenging for developments of advanced parallel computers and technology.