Search

bstract [ABSTRACT FROM AUTHOR]

In this paper a cellular array has been described where each cell contains a threshold gate. It has been shown that this array can be used to realize any Boolean function and that just two tests are sufficient to test the entire array for faults. An extension of the principle of this array has been described. It deals with the design of an array where a faulty cascade, if there be any, is automatically by-passed and an identical fault-free cascade is introduced into the array. [ABSTRACT FROM AUTHOR]

The paper presents a table look-up method for testing threshold and isobaric functions by finding out the possible 2-summable and mutually 2-summable pairs of minterms respectively. The method provides ready visualization of such pairs with a much less computational labor than the methods suggested so far. It has been shown that there will be further reduction in computational labor if the test functions are made positive unate.
Various methods have been suggested by different workers (Winder 1962, Hopcroft and Mattson 1965, Sinha Roy 1968, Ghosh et al. 1972) for 2-asummability testing of Boolean functions.
In the synthesis of variable threshold logic elements (Meisel 1968) and multithreshold threshold logic elements (Haring 1966, Ghosh et al. 1969) testing of isobaricity plays an important role. Recently, it has been shown (Ghosh et al. 1972) that for two threshold functions to be isobaric, mutual 2-asummability is the necessary and sufficient condition for n 7, where n is the number of variables.
A new method has been described for testing linear separability and isobaricity of switching functions by finding out all possible 2-summable and mutually 2-summable pairs of minterms respectively. Such minterm pairs are readily looked up from a table with very little computational labor The labor reduces further in case the test functions are made positive unate.
The process of obtaining the list of 2-summable and mutually 2-summable pairs of minterms for positive unate functions can be easily programmed in a computer. [ABSTRACT FROM AUTHOR]

BSTRACT [ABSTRACT FROM AUTHOR]