Boolean Functions The following steps are generally followed while designing the logic circuits using Boolean functions. Analysis of the given statement of the problem to find the number of variables Writing the truth table from the given statement Conversion of the truth table into a logic function/ Boolean expression using standard product of sums(SOP) or product of sums (POS) Simplify the Boolean expression Create the logic circuit using logic gates SOP and POS equations Sum of Product (SOP) equation The SOP equations are formed by ORing the product or the min-terms. Formation of Minterm and Maxterm A B C Minterm(mi) Maxterms(Mi) 0 0 0 A’B’C’ =m0 A+B+C   =M0 0 0 1 A’B’C =m1 A+B+C’  =M1 0 1 0 A’BC’ =m2 A+B’+C  =M2 0 1 1 A’BC  =m3 A+B’+C’ =M3 1 0 0 AB’C’ =m4 A’+B+C  =M4 1 0 1 AB’C  =m5 A’+B+C’  =M5 1 1 0 ABC’  = m6 A’+B’+C  =M6 1 1 1 ABC    = m7 A’+B’+C’ =M7 Min terms The input combinations for which the output equals ‘1’ is called