October 2006
Intermediate to advanced
544 pages
14h 29m
English
In Chapter 4, we studied Boolean algebraic rules, laws and theorems and their uses in simplifying a logic circuit. We also discussed the concept of SOPs and POSs to write Boolean expression in terms of a standard format for implementation by AND gates and OR gates. In this chapter, we shall learn how to develop a Karnaugh map, tabulate the minterms, and minimize a circuit using the map. Computer-aided minimization procedure will also be studied.
Recall the truth tables at the insets in Figures 4.1(a) to (d) and 4.2(a) to (d) and in Tables 4.3 to 4.12. We note that truth table has all possible ...
Read now
Unlock full access