Downloaded 15 times
HP
Uploaded byHeman Pathak
564 views
Simplification of Boolean Function
The document discusses canonical forms, Karnaugh maps, and simplification of Boolean functions. It begins by defining canonical forms as expressing a Boolean function as a sum of minterms or product of maxterms. It then discusses Karnaugh maps, including 2, 3, and 4 variable maps. Methods for simplifying Boolean functions using Karnaugh maps such as grouping adjacent minterms are also covered. The document concludes by discussing product of sums simplification, NAND/NOR implementations, and don't care conditions.
