An Algorithm for Testing 2-Asummability of Boolean Functions

Sarje, AK and Biswas, NN (1977) An Algorithm for Testing 2-Asummability of Boolean Functions. In: IEEE Transactions on Computers, C-26 (10). pp. 1049-1053.

PDF An_Algorithm.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy

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.

Item Type:	Journal Article
Publication:	IEEE Transactions on Computers
Publisher:	IEEE
Additional Information:	Copyright 1977 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords:	Algorithm;asummability;2-asummability;linear separability;2-summability;S-sequence;threshold functions.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	05 Jan 2012 05:36
Last Modified:	05 Jan 2012 05:36
URI:	http://eprints.iisc.ac.in/id/eprint/43054

Actions (login required)

View Item