![]() ![]() ![]() Each method has it’s own merits and demerits. Minimization can be done using Algebraic Manipulation or K-Map method. Minimization is hence important to find the most economic equivalent representation of a boolean function. It is clear from the above image that the minimized version of the expression takes a less number of logic gates and also reduces the complexity of the circuit substantially. The circuits associated with above expressions is – Minimization is important since it reduces the cost and complexity of the associated circuit.įor example, the function can be minimized to. The process of simplifying the algebraic expression of a boolean function is called minimization. Since the number of literals in such an expression is usually high, and the complexity of the digital logic gates that implement a Boolean function is directly related to the complexity of the algebraic expression from which the function is implemented, it is preferable to have the most simplified form of the algebraic expression. ISRO CS Syllabus for Scientist/Engineer ExamĪs discussed in the “Representation of Boolean Functions” every boolean function can be expressed as a sum of minterms or a product of maxterms.ISRO CS Original Papers and Official Keys.GATE CS Original Papers and Official Keys. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |