DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click HERE
to register or log in.
REALIZATION OF SEQUENTIAL MACHINES WITH THRESHOLD ELEMENTS.
TEXAS UNIV AT AUSTIN LABS FOR ELECTRONICS AND RELATED SCIENCE RESEARCH
This paper presents an algorithm which, given a sequential machine with completely specified state and output tables, yields all code assignments for which the state-variable and output-variable functions are 2-asumable. The condition of 2-asummability is a necessary one for linear separability. It is also sufficient for functions of less than eight variables. Hence, the code assignments for which the corresponding threshold gate realizations are one-level are contained in the set obtained in the algorithm. This paper first concerns itself with making some definitions relevant to the three concepts underlying the condition of 2-asummability.
Contract Number 2: