DocumentCode
1133646
Title
An Algorithm for Testing 2-Asummability of Boolean Functions
Author
Sarje, Anil K. ; Biswas, Nripendra N.
Author_Institution
School of Automation, Indian Institute of Science
Issue
10
fYear
1977
Firstpage
1049
Lastpage
1053
Abstract
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.
Keywords
Algorithm, asummability, 2-asummability, linear separability, 2-summability, S-sequence, threshold functions.; Arithmetic; Automation; Boolean functions; Sufficient conditions; Testing; Algorithm, asummability, 2-asummability, linear separability, 2-summability, S-sequence, threshold functions.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1977.1674745
Filename
1674745
Link To Document