Abstract

In this paper, a simple approach for detection of adjacent minterms and minimization technique is proposed. The proposed method factorized each minterms and 'don't –care' conditions into a group of maximum three inputs variables and these groups of minterms further coupled as per laws of simplification. The entire detection procedure is described here by mix binary –octal representations. A chart proposed in this paper for easy detection of adjacent minterms with fewer numbers of comparisons and can use for any number of variables. Logic adjacency property is played a significant role for logic circuit simplification. This novel method reduces the complexity of two-level simplification procedure. This paper also represents the performance of octal minterms based combinational circuit minimization technique in comparison with other traditional methods. The paper deals with a method based on representing minterms in the octal system that can be better suited for the manual method of logic minimization and hence may be worth considering.

Full Text
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

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.