Realizations of Sequential Machines Using Random Access Memory

Authors:
E. J. Wilkens
Affiliations:
Interdata, Inc.
Venue:
IEEE Transactions on Computers
Year:
1978

Citing 4
Cited 0

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Direct Transition Memory and its Application in Computer Design

IEEE Transactions on Computers
On the Minimization of READ-ONLY Memories in Microprogrammed Digital Computers

IEEE Transactions on Computers
Systematic Procedures for Realizing Synchronous Sequential Machines Using Flip-Flop Memory: Part I

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

Modern large scale integration techniques, microcomputers, and programming techniques have made the classical realizations of sequential machines obsolete. These applications of sequential machines all occur in environments where random access memory, whether read-only or writable, is an extremely cost effective device. This paper presents a realization of a sequential machine which preserves the multiport branching characteristic of a sequential machine. A structure theory and a design technique are presented which allow an optimal memory size realization to be found.