Abstract
A general algorithm is presented for the efficient computation of feed-forward nets of general threshold gates which realize given bi-valued switching functions. A simplified version of the algorithm is presented for the case of symmetric threshold nets which realize symmetric switching functions. These algorithms produce near-minimal gate nets, and the results of a digital computer program for the general algorithm are presented to illustrate the degree of efficiency and minimality obtained in practice. Both algorithms are proved to give a minimal one-gate net if one exists for a given switching function; a necessary criterion is given for the symmetric algorithm to produce a minimal two-gate net if one exists; and two-gate minimality is also demonstrated for the general algorithm, for a certain class of two-gate switching functions. The case of partially defined switching functions is also treated.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
