
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S.H. Unger, "Some Additions to "Solution of Switching Equations Based on a Tabular Algebra"," IEEE Transactions on Computers, vol. 43, no. 3, pp. 365367, March, 1994.  
BibTex  x  
@article{ 10.1109/12.272437, author = {S.H. Unger}, title = {Some Additions to "Solution of Switching Equations Based on a Tabular Algebra"}, journal ={IEEE Transactions on Computers}, volume = {43}, number = {3}, issn = {00189340}, year = {1994}, pages = {365367}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.272437}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Some Additions to "Solution of Switching Equations Based on a Tabular Algebra" IS  3 SN  00189340 SP365 EP367 EPD  365367 A1  S.H. Unger, PY  1994 KW  Boolean functions; switching equations; tabular algebra; Boolean equations; Boolean expressions; complemented subexpressions. VL  43 JA  IEEE Transactions on Computers ER   
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.