Simplification of Boolean functions

← Back to document page

Draft notes or 22C: 0402Simplification of Boolean functionsUsing the theorems of Boolean Algebra, the algebraicforms of functions can often be simplified, which leads tosimpler (and cheaper) 1F = + + (B + B) + How many gates do you save= + from this Simplification ?=A + FBFCCDraft notes or 22C: 0403Example 2F= + + + + + + + + ( + ) + ( + ) + ( + )=(A + A). + (B + B). + (C + C). + + 3Show that A + = AA + AB= + (1 + B)=A. 1=ADraft notes or 22C: 0404Simplification using Karnaugh MapsAB01101K-map of 2-variable OR function011BCA000111100 11111K-map of majority functionFollow the class lectures to understand how tosimplify Boolean functions using K-maps.

adders, subtractors, and all the circuits that we have studied so far Sequential circuits. The output depends not only on the current values of the inputs, but also on their past values. These hold the secret of how to memorize information. We will study sequential circuits later.

  Dread