Single threshold device realization subject to sensitivity requirements

Abstract A method to test and realize linearly-separable switching functions subject to specified sensitivity requirements is presented. A procedure is developed to take advantage of a universal map (Torng-Map). This approach appears to offer significant improvements over available methods. A detailed example is furnished.

[1]  C. L. Sheng,et al.  A Method for Testing and Realization of Threshold Functions , 1964, IEEE Trans. Electron. Comput..

[2]  C. A. Gaston.  A Simple Test for Linear Separability , 1963, IEEE Trans. Electron. Comput..

[3]  Clarence L. Coates,et al.  A Simplified Procedure for the Realization of Linearly-Separable Switching Functions , 1962, IRE Trans. Electron. Comput..

[4]  Clarence L. Coates,et al.  Realization of Logical Functions by a Network of Threshold Components with Specified Sensitivity , 1963, IEEE Trans. Electron. Comput..

[5]  Robert McNaughton,et al.  Unate Truth Functions , 1961, IRE Trans. Electron. Comput..

[6]  Clarence L. Coates,et al.  A Realization Procedure for Threshold Gate Networks , 1963, IEEE Trans. Electron. Comput..

[7]  Hwa C. Torng.  An Approach for the Realization of Linearly-Separable Switching Functions , 1966, IEEE Trans. Electron. Comput..

[8]  Saburo Muroga,et al.  Functional forms of majority functions and a necessary and sufficient condition for their realizability , 1961, SWCT.

[9]  Sheldon B. Akers.  Threshold logic and two-person, zero-sum games , 1961, SWCT.

[10]  Richard Lindaman,et al.  A Theorem for Deriving Majority-Logic Networks Within an Augmented Boolean Algebra , 1960, IRE Trans. Electron. Comput..

[11]  Irving J. Gabelman,et al.  The Synthesis of Boolean Functions Using a Single rrhreshold Element , 1962, IRE Trans. Electron. Comput..

[12]  Robert C. Minnick,et al.  Linear-Input Logic , 1961, IRE Trans. Electron. Comput..