This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Numerical Algorithm for the Resolution of Boolean Equations
September 1974 (vol. 23 no. 9)
pp. 983-986
W. Del Picchia, Departamento de Engenharia de Eletricidade, Escola Polit?cnica da Universidade de S?o Paulo
This correspondence presents the remainder-quotient (RQ)-algorithm for the resolution of Boolean equations. If [mi]w = w ( xkl, xj2, ... XkN) = 1[/mi] is the Boolean equation equivalent to the system whose solution is desired, we want to determine the Boolean functions [mi]xk, = Xkp ( xhj+1,... -xkN)[/mi] with p = 1,2,... j, which verify the equivalent equation. We start with the function w given by its minterm numbers and performing usual divisions we determine the solutions in the domain of the numerical transform (NT), introduced in a previous paper. An alternative way is also presented, which is advantageous when the number of minterms in the equivalent equation is large. Examples which show the great systematization of the methods are given.
Index Terms:
Boolean equation, computation, consistence, numerical algorithm, transformation.
Citation:
W. Del Picchia, "A Numerical Algorithm for the Resolution of Boolean Equations," IEEE Transactions on Computers, vol. 23, no. 9, pp. 983-986, Sept. 1974, doi:10.1109/T-C.1974.224067
Usage of this product signifies your acceptance of the Terms of Use.