The P-table and its application to second and third-order simplification of Boolean functions
Kanti Bhusan Bhowmik, Bimal Bhowmik
Abstract
Kanti Bhusan Bhowmik, Bimal Bhowmik
Abstract
A technique has been developed in this article for obtaining the ‘ product of sum ’ expression from the ‘ sum of product ’ expression of a Boolean function. In this technique, first a tabular representation is made with the product terms and the variables present in the function specified in the ‘ sum of product ’ form and then appropriate rows of the table are combined to give different sum terms. The idea of the technique has also been extended for obtaining the third-order minimal expression of a Boolean function.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A technique has been developed in this article for obtaining the ‘ product of sum ’ expression from the ‘ sum of product ’ expression of a Boolean function. In this technique, first a tabular representation is made with the product terms and the variables present in the function specified in the ‘ sum of product ’ form and then appropriate rows of the table are combined to give different sum terms. The idea of the technique has also been extended for obtaining the third-order minimal expression of a Boolean function.
Key concepts: Product term, Canonical normal form, Boolean function, Table (database), Product (mathematics), Expression (computer science), Boolean expression, Mathematics