Srivatsa, SK and Biswa, NN (1978) Karnaugh map synthesis of multigate threshold networks. In: International Journal of Systems Science, 9 (7). 785-797 .Full text not available from this repository.
It has been shown in an earlier paper that I-realizability of a unate function F of up to six variables corresponds to ' compactness ' of the plot of F on a Karnaugh map. Here, an algorithm has been presented to synthesize on a Karnaugh map a non-threahold function of up to Bix variables with the minimum number of threshold gates connected in cascade. Incompletely specified functions can also be treated. No resort to inequalities is made and no pre-processing (such as positivizing and ordering) of the given switching function is required.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Taylor and Francis Group.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||08 Oct 2010 10:44|
|Last Modified:||08 Oct 2010 10:44|
Actions (login required)