Abstract
With the advent of symbolic techniques for Boolean and pseudoBoolean function manipulation, spectral transformations have become more relevant in the areas of logic synthesis and formal verification. The authors propose a symbolic algorithm based on algebraic decision diagrams, a data structure for the efficient manipulation of matrices and graphs, to compute the agreement between pairs of Boolean functions. Such an algorithm, operating in the transform domain, allows Boolean functions of over 80 input variables to be handled in a very short time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEE Proceedings - Computers and Digital Techniques
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
