7. NAND NAND implementation A B C D E E F=AB+CD+E _
8. The NAND function is so implemented ,that it can be easily converted to a Sum Of products form by using DeMorgans theorem A B C D E E _ AB CD F=AB.CD.E __ __ _ _______ F=AB+CD+E
12. AND-OR-invert implementation A B C D E F=AB+CD+E ________ AB CD E The two forms NAND-AND and AND-OR are equalent forms And can be treated .Both perform the AND-OR-INVERT AND-NOR
13. A B C D E AB CD E F=AB.CD.E __ __ _ F=AB+CD+E ________ AND-NOR circuit
14. AB CD A B C D E __ __ E _ F F=AB+CD+E ________ NAND-AND
15.
16. A B C D E F F=(A+B)+(C+D)+E =(A+B).(C+D).E _____ ____ OR-NAND