4 April 1986 Design Methodology For Systolic Arrays
Author Affiliations +
Abstract
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.
© (1986) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jean-Marc Delosme, Ilse C. F. Ipsen, "Design Methodology For Systolic Arrays", Proc. SPIE 0696, Advanced Algorithms and Architectures for Signal Processing I, (4 April 1986); doi: 10.1117/12.936899; https://doi.org/10.1117/12.936899
PROCEEDINGS
15 PAGES


SHARE
RELATED CONTENT

Modified Faddeev Algorithm For Matrix Manipulation
Proceedings of SPIE (November 28 1984)
Systolic Architecture For Extended Kalman Filtering
Proceedings of SPIE (January 21 1988)
Implementation Of Cellular Arrays
Proceedings of SPIE (July 30 1982)
Design Considerations For Real-Time Image Processing
Proceedings of SPIE (September 21 1979)
Systolic Computation Of Multivariable Frequency Response
Proceedings of SPIE (April 20 1988)

Back to Top