The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (1998 vol.47)
pp: 171-177
ABSTRACT
<p><b>Abstract</b>—Boolean equations are important tools in digital logic. Previous algorithms for solving Boolean equations are based on the Boolean algebra of disjoint SOP forms. In this paper, we develop a new Boolean algebra with more efficient Boolean operation algorithms, called the reduced ordered SOP (ROSOP) forms, which are canonical representations. ROSOPs are closely related to the well-known OBDD data structure. The results here also show the algebraic structure of OBDDs.</p>
INDEX TERMS
Boolean algebra, operations, functions, equations, and decision diagrams, SOP forms, equation solving algorithms.
CITATION
Yuke Wang, Carl McCrosky, "Solving Boolean Equations Using ROSOP Forms", IEEE Transactions on Computers, vol.47, no. 2, pp. 171-177, February 1998, doi:10.1109/12.663763
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool