论文信息 - An Algorithm for Testing 2-Asummability of Boolean Functions

An Algorithm for Testing 2-Asummability of Boolean Functions

Simple algorithms have been developed to generate pairs of minterms forming a given 2-sum and thereby to test 2-asummability of switching functions. The 2-asummability testing procedure can be easily implemented on the computer. Since 2-asummability is a necessary and sufficient condition for a switching function of upto eight variables to be linearly separable (LS), it can be used for testing LS switching functions of upto eight variables.

Nripendra N. Biswas | Anil K. Sarje | N. Biswas | A. Sarje

[1] John E. Hopcroft,et al. Synthesis of Minimal Threshold Logic Networks , 1965, IEEE Trans. Electron. Comput..

[2] Saburo Muroga,et al. Threshold logic and its applications , 1971 .

[3] Sureshchander. An Algorithm for Testing Asummability of Boolean Functions , 1974, IEEE Transactions on Computers.

[4] Clarence L. Coates,et al. Decimal Numbers for Checking Summability , 1966, IEEE Trans. Electron. Comput..

[5] Sujit Kumar Ghosh,et al. Simple Methods for the Testing of 2-Summability of Boolean Functions and Isobaricity of Threshold Functions , 1972, IEEE Transactions on Computers.

[6] P. K. Sinha Roy. A Slide Rule Device for Checking 2-Summability , 1968, IEEE Trans. Computers.

[7] Nripendra U. Biswas,et al. Introduction to Logic and Switching Theory , 1975 .