DocumentCode
1347519
Title
Solving Boolean equations using ROSOP forms
Author
Wang, Yuke ; McCrosky, Carl
Author_Institution
Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada
Volume
47
Issue
2
fYear
1998
fDate
2/1/1998 12:00:00 AM
Firstpage
171
Lastpage
177
Abstract
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
Keywords
Boolean algebra; computational complexity; logic design; Boolean algebra; Boolean equations; ROSOP forms; and decision diagrams; digital logic; functions; operations; reduced ordered SOP; Algorithm design and analysis; Boolean algebra; Combinational circuits; Data structures; Digital circuits; Equations; Logic; Signal design; Test pattern generators; Testing;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.663763
Filename
663763
Link To Document