1. C ONONICAL F ORMS OF B OOLEAN E XPRESSIONS

2. T HE S UM - OF - PRODUCTS (SOP) E XPRESSIONS When two or more product terms (Boolean Multiplication) are summed by Boolean addition. For Example. AB + AD’ A + A’B’C + A’B’ Each SOP expression can be implemented by simply ORing the outputs of two or more AND gates. SOP expressions can be implemented by AND-OR realization. We can also implement SOP expressions with the help of NAND-NAND realization.

3. T HE S UM - OF - PRODUCTS (SOP) E XPRESSIONS A B B C D A C AB BCD AC Y Y=AB + BCD + AC

4. S AME E XAMPLE W ITH NAND-NAND REALIZATION A B C A C B D (AB)’ (BCD)’ (AC)’ Y Y=((AB)’.(BCD)’.(AC)’)’(AB)’’+(BCD)’’+(AC)’’  AB+BCD+AC

5. T HE P RODUCT - OF - SUMS (POS) EXPRESSIONS When two or more sum terms are multiplied by Boolean multiplication. For Example. (A+B).(A+C’) (A+B).(B+C+D’).(A’+C) Each POS expressions can be implemented by simply ANDing the outputs of two or more OR gates. POS expression can be implemented by OR-AND realization. POS expression can also be implemented with the help of NOR-NOR realization.