Skip to Main Content
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.
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on (Volume:31 , Issue: 7 )
Date of Publication: July 2012