论文信息 - Design Methodology For Systolic Arrays

Design Methodology For Systolic Arrays

Many important algorithms in signal and image processing, speech and pattern recognition or matrix computations consist of coupled systems of recurrence equations. Systolic arrays are regular networks of tightly coupled simple processors with limited storage that provide cost-effective high-throughput implementations of many such algorithms. While there are some mathematical techniques for finding efficient systolic implementations for uniform recurrence equations, there is no general theory for more general coupled systems of affine recurrence equations. The first elements of such a theory are presented in this paper.

Ilse C. F. Ipsen | Jean-Marc Delosme | J. Delosme

[1] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[2] J. H. Wilkinson. The algebraic eigenvalue problem , 1966 .

[3] David L. Kuck,et al. The Structure of Computers and Computations , 1978 .

[4] J M Delosme,et al. Efficient Systolic Arrays for the Solution of Toeplitz Systems: An Illustration of a Methodology for the Construction of Systolic Architectures in VLSI (Very Large Systems Integration). , 1985 .

[5] Dan I. Moldovan,et al. On the Analysis and Synthesis of VLSI Algorithms , 1982, IEEE Transactions on Computers.

[6] D.I. Moldovan,et al. On the design of algorithms for VLSI systolic arrays , 1983, Proceedings of the IEEE.

[7] Thomas Kailath,et al. Regular iterative algorithms and their implementation on processor arrays , 1988, Proc. IEEE.

[8] Patrice Quinton. Automatic synthesis of systolic arrays from uniform recurrent equations , 1984, ISCA '84.

[9] Richard M. Karp,et al. The Organization of Computations for Uniform Recurrence Equations , 1967, JACM.

[10] R. Karp,et al. Properties of a model for parallel computations: determinacy , 1966 .