Abstract
Abstract The binary coded form of minterms for both minterms and reduced minterms is used in a very simple method for searching for prime implicants of logic functions. It only requires XOR and comparison operations.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
