Referenced Items are not available for this document.
We determine an explicit procedure for representing any Boolean expression in a recursive form which can be realized using memristive devices, and demonstrate how the truth value of any Boolean expression can be determined using no more than two computing memristive devices. We present an algorithm which can be used to significantly reduce the number of implications required for representing a specific Boolean expression, and consider device-specific benefits in terms of reducing the lengths of computational sequences.
Published in:
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
(Volume:31
,
Issue:
7
)
Date of Publication: July 2012
- Page(s):
- 1129 - 1134
- ISSN :
- 0278-0070
- INSPEC Accession Number:
- 12786787
- Digital Object Identifier :
- 10.1109/TCAD.2012.2187524
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 14 June 2012
- Issue Date :
- July 2012
- 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.
