Abstract
The article discusses a two-stage method of minimizing Boolean functions for designing digital combinational circuits. At the first stage, the search for simple conjuncterms is carried out by the method of bitwise division of the set of initial conjuncterms. At this way tautology does not appear, low-rank conjuncterms are found without intermediate gluing. At the second stage, the search for the minimal set of simple conjuncterms is performed by the method of chain coverage of the table of simple conjuncterms. In the cyclic part, fragments of chain functions are found, the coverage of which is quite simple. To reduce the computational load at branching points of chains, a decision can be made about entering or removing the corresponding simple conjuncterm from the finite set based on the calculation of the complexity factor in the vicinity of the branching. The proposed method is heuristic.
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: Information and communication technologies, electronic engineering
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.
