Karnaugh map synthesis of multigate threshold networks

Abstract

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.

Additional information

Notes on contributors

S. K. SRIVATSA

Present address: Electronics Engineering Faculty, Madras Institute of Technology, Chromepet, Madras 600 044, India.