On maximum stability realizations of linearly separable Boolean functions

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.