Delayed Universal Logic Modules and Sequential Machine Synthesis

Authors:
T. Le Van;N. Van Houtte
Affiliations:
Centre de Recherche Industrielle du Québec, Cité Universitaire;-
Venue:
IEEE Transactions on Computers
Year:
1975

Citing 2
Cited 1

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)
Universal Logic Modules and Their Applications

IEEE Transactions on Computers

Minimum Universal Logic Module Sequential Circuits with Decoders

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.