Abstract
A procedure for finding out the prime implicants and hence the minimal sum(s) of Boolean functions containing essential prime implicants, cyclic type prime implicants or functions with optional terms has been suggested in this paper. The conception of the present procedure is based on the geometrical representation of Boolean functions. The procedure is also applicable for obtaining the prime implicants of a multiple output function.
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 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.
