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.
Russian Microelectronics – Springer Journals
Published: Sep 2, 2015
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud