Loading [MathJax]/extensions/MathMenu.js
Formal Verification of Completion-Completeness for NCL Circuits | IEEE Conference Publication | IEEE Xplore

Formal Verification of Completion-Completeness for NCL Circuits


Abstract:

Ensuring completion-completeness is required for delay-insensitivity when utilizing bit-wise completion to pipeline NCL circuits comprised of input-incomplete logic funct...Show More

Abstract:

Ensuring completion-completeness is required for delay-insensitivity when utilizing bit-wise completion to pipeline NCL circuits comprised of input-incomplete logic functions. Hence, this work presents an automated formal method to detect NCL circuits that are not completion-complete.
Date of Conference: 09-12 August 2020
Date Added to IEEE Xplore: 02 September 2020
ISBN Information:

ISSN Information:

Conference Location: Springfield, MA, USA

Contact IEEE to Subscribe

References

References is not available for this document.