This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
June 1970 (vol. 19 no. 6)
pp. 565-566
C.L. Sheng, University of Ottawa
This paper deals with the realization of the combinatorial logic network of sequential machines with threshold logic elements, with a view to one- level realization. The state assignment problem is already a difficult one, and here it is further complicated by the restriction that the logical gates to be used are all threshold logic elements. This problem is quite important and is worthy of intensive study because, although threshold logic element as a general gate is well known, its value is not fully appreciated unless its applicability in various situations is demonstrated.
Citation:
C.L. Sheng, "R70-15 Realization of Sequential Machines with Threshold Elements," IEEE Transactions on Computers, vol. 19, no. 6, pp. 565-566, June 1970, doi:10.1109/T-C.1970.222986
Usage of this product signifies your acceptance of the Terms of Use.