Referenced Items are not available for this document.
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
Published in:
Computers, IEEE Transactions on
(Volume:47
,
Issue:
2
)
Date of Publication: Feb 1998
- Page(s):
- 171 - 177
- ISSN :
- 0018-9340
- INSPEC Accession Number:
- 5859409
- Digital Object Identifier :
- 10.1109/12.663763
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Feb 1998
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
