This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
On maximum stability realizations of linearly separable Boolean functions
Ann Arbor, MI
October 06-October 08
This paper is concerned with the realization of linearly separable switching functions where the realization has maximum stability to coefficient and logical signal fluctuations. A realization algorithm is presented for sequentially selecting the coefficients where each coefficient is as small as possible given the values of the previously selected coefficients and the requirement that the realization have unit gap length. As yet it is undetermined whether the algorithm always yields a realization for which the ratio of gap length to sum of coefficients is a maximum.
Citation:
C. L. Coates, Vatana Supornpaibul, "On maximum stability realizations of linearly separable Boolean functions," focs, pp.12-24, 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965), 1965
Usage of this product signifies your acceptance of the Terms of Use.