An Algorithm for Finding Boolean Differences
Suresh Rai, K.K. Aggarwal
Abstract
Suresh Rai, K.K. Aggarwal
Abstract
Boolean differences are helpful in studying the fault diagnosis problems of logic circuits which ultimately help in reliable computing. A simple algorithm is proposed for finding out the Boolean differences for any switching function. Using the proposed algorithm, we can evaluate Boolean differences for any function with respect to all its arguments.
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.
Boolean differences are helpful in studying the fault diagnosis problems of logic circuits which ultimately help in reliable computing. A simple algorithm is proposed for finding out the Boolean differences for any switching function. Using the proposed algorithm, we can evaluate Boolean differences for any function with respect to all its arguments.
Key concepts: Algorithm, Boolean expression, Circuit minimization for Boolean functions, Boolean function, Computer science, Product term, And-inverter graph, Boolean circuit