Year-end Sale % OFF 
Abstract
The results of the experimental comparison of minimization programs for various forms of representations of the systems of completely specified Boolean functions are described. The experiments show that the minimization programs of multilevel representations based on the Shannon expansion and decomposition are preferential when synthesizing combinational logic circuits from library elements compared to the minimization programs in a class of disjunctive normal forms.
Published Version
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.
