Referenced Items are not available for this document.
This paper describes linear cofactor relationships (LCRs), which are defined as the exclusive sums of cofactors with respect to a pair of variables in Boolean functions. These relationships subsume classical symmetries and single-variable symmetries. The paper proposes an efficient algorithm to detect LCRs and discusses their potential applications in Boolean matching, minimization of decision diagrams, synthesis of regular layout-friendly logic circuits, and detection of support-reducing bound sets
Published in:
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
(Volume:25
,
Issue:
6
)
Date of Publication: June 2006
- Page(s):
- 1011 - 1023
- ISSN :
- 0278-0070
- INSPEC Accession Number:
- 8959012
- Digital Object Identifier :
- 10.1109/TCAD.2005.855951
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 08 May 2006
- Issue Date :
- June 2006
- Sponsored by :
- IEEE Council on Electronic Design Automation
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.
