Abstract
The goal of this paper is to exemplify a conceptual framework, namely the theory of finite state machines, for the VLSI design process. We start from a functional description of the system to be realized and achieve a (semi)systolic array in a formal way. Moreover, the resulting designs are correct by their mere construction.
A related paper [14] is presented to the International Conference on Systolic Arrays, San Diego, May 1988
partially supported by Siemens AG
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.H. Chang, O.H. Ibarra, and M.A. Palis. Parallel parsing on a one-way array of finite-state machines. IEEE Trans. Comp., C-36(1):64–75, January 1987.
S.N. Cole. Real-time computation by n-dimensional iterative arrays of finite state machines. IEEE Trans. Comp., C-18(4):349–365, April 1969.
A. Gill. Linear Sequential Circuits. McGraw-Hill Book Company, 1966.
L.A. Glasser and D.W. Dobberpuhl. The Design and Analysis of VLSI Circuits. Addison-Wesley, 1985.
W. Grass. Some results on the design of regular structured sequential circuits. Integration, 3:189–210, 1985.
J. Hartmannis and R.E. Stearns. Algebraic Structure Theory of Sequential Machines. Prentice Hall, Inc., 1966.
O.H. Ibarra, M.A. Palis, and S.M. Kim. Designing Systolic Algorithms Using Sequential Machines. Technical Report, Universty of Minnesota, CS Dept., Inst. of Tech., 1984.
Z. Kohavi. Switching and Finite Automata Theory. Computer Science Series, McGraw-Hill, 1970.
H.T. Kung. Why systolic architectures? IEEE Computer, January 1982.
C.E. Leiserson. Area Efficient VLSI Computation. ACM-MIT Doctoral Dissertation Award Series, 1983.
C.E. Leiserson and J.B. Saxe. Optimizing synchronous systems. Journal of VLSI and Computer Systems, 1(1):41–67, 1983.
D.I. Moldovan. On the design of algorithms for VLSI systolic arrays. Proc. IEEE, 71(1):13–120, January 1983.
M. Payer. An algebraic approach to the design of pipelined sequential circuits. June 1986. Interner Bericht, FB Informatik, Universität Hamburg.
M. Payer. Formal derivation of systolic arrays — a case study. May 1988. International Conference on Systolic Arrays, San Diego 1988. To appear in the conference proceedings.
M. Payer. On systolic arrays and machine decompositions. June 1986. Interner Bericht, FB Informatik, Universität Hamburg.
C.H. Sequin. Managing VLSI complexity: an outlook. Proc. IEEE, 71(1):149–166, January 1983.
H.S. Stone. Discrete Mathematical Structures and their Applications. Science Research Associates, 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Payer, M. (1990). Finite state machine theory as a tool for construction of systolic arrays. In: Pichler, F., Moreno-Diaz, R. (eds) Computer Aided Systems Theory — EUROCAST '89. EUROCAST 1989. Lecture Notes in Computer Science, vol 410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52215-8_19
Download citation
DOI: https://doi.org/10.1007/3-540-52215-8_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52215-7
Online ISBN: 978-3-540-46932-2
eBook Packages: Springer Book Archive