The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1974 vol.23)
pp: 897-906
W.K. Giloi , the Department of Computer, Information, and Control Sciences, University of Minnesota
ABSTRACT
The design methodology developed in the paper is based on an APL-like definition of logical arrays and operations on such arrays. First, the notion of a logical algorithm is introduced as a finite state automaton described by transition and output matrix. The technical realizations of such algorithms is then uniformly described as time-discrete, space-discrete, and time-space-discrete systems, and the transition of an algorithm from state-to-state (or space node-to-space node) can be explicitly formulated in a very concise way. An application of this formalism to the state reduction problem is shown. Thus the paper extends the APL-based design of logical networks beyond the area of combinational networks as developed first by Iverson.
INDEX TERMS
Algebraic design procedures, APL-type design language, Boolean arrays, combination, iterative, and sequential networks, hardware implementation of logical algorithms, network analysis and synthesis, state reduction.
CITATION
W.K. Giloi, H. Liebig, "A Formalism for Description and Synthesis of Logical Algorithms and their Hardware Implementation", IEEE Transactions on Computers, vol.23, no. 9, pp. 897-906, September 1974, doi:10.1109/T-C.1974.224053
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool