This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Some Additions to "Solution of Switching Equations Based on a Tabular Algebra"
March 1994 (vol. 43 no. 3)
pp. 365-367

A method was presented by A.L. Ruiz, P.P. Trabado, and J.O. Lopera for efficiently generating the solutions of Boolean equations by using tables (i.e., rectangular arrays or matrices) of 0's, 1's, and dashes to represent Boolean expressions. Some enhancements of their method are presented. First, it is shown how the uniting theorem can be applied directly to simplify tables. Then it is shown how to complement a table, which would make their method (henceforth referred to as RTL) directly applicable to expressions containing complemented subexpressions. The latter result allows the method to be extended from the solution of equations of the form f(X)=1 to equations of the form f(X)=0, and, more generally to equations of the form f(X)=g(X), or to simultaneous equations of the same types.

[1] A. L. Ruiz, P. P. Trabado, and J. O. Lopera, "Solution of switching equations based on a tabular algebra,"IEEE Trans. Comput., vol. 42, no. 5, pp. 591-596, May 1993.

Index Terms:
Boolean functions; switching equations; tabular algebra; Boolean equations; Boolean expressions; complemented subexpressions.
Citation:
S.H. Unger, "Some Additions to "Solution of Switching Equations Based on a Tabular Algebra"," IEEE Transactions on Computers, vol. 43, no. 3, pp. 365-367, March 1994, doi:10.1109/12.272437
Usage of this product signifies your acceptance of the Terms of Use.