Delayed Universal Logic Modules and Sequential Machine Synthesis

• Published in: IEEE transactions on computers Vol. C-24; no. 8; pp. 853 - 855
• Main Authors: Le Van, T., Van Houtte, N.
• Format: Journal Article
• Language: English
• Published: IEEE 01-08-1975
• Subjects: 2n-in-1 multiplexer; Accepted sequence; component machine; decomposition; delayed universal logic module; distributed logic; inverse binary tree; nondeterministic automaton; reversed machine; sequential machine; simple synthesis; transition map; universal logic module
• ISSN: 0018-9340; 1557-9956
• DOI: 10.1109/T-C.1975.224323

A universal logic module of n variables (ULM-n) can be considered as a 2n-in-1 multiplexer (inverse binary tree) whose code is determined by the presentation of external variables. This interpretation permits synthesis of sequential machines. Starting from the state transition map, any sequential machine can be realized by delayed ULM's and OR gates. The decomposition concept of Weiner and Hopcroft is generalized to form a uniform synthesis of n-variable sequential machines.