Abstract
As an important tool in digital circuit design, Boolean matching can recognize equivalence between two completely specified Boolean functions and improve logic synthesis result. The spectral transform is widely used in Boolean matching. In this paper, a method using the Hadamard transform is proposed to speed up Boolean matching. Experimental results show that our algorithm can finish matching in short time, which satisfies practical demands.
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 callDisclaimer: 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.
