Abstract
Algorithms for minimizing multilevel representations of systems of incompletely defined Boolean functions for various initial functional forms are proposed. The multilevel representations are based on the Shannon decomposition. Results of experimental studies indicate that the proposed algorithms are efficient for synthesizing logic circuits of library elements.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Computer and Systems Sciences International
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.