Scribd
Upload
28 views

Boolean Algebra Theory

Boolean algebra allows us to represent and manipulate binary information using logical operations and identities. Some key concepts covered include: - Using Boolean identities like distribution, inverse, and identity laws to simplify expressions in a similar way as algebraic simplification. Examples show rewriting expressions like ~xyz + ~xy~z + xz as ~xy + xz. - DeMorgan's law, which states that the negation of a conjunction (X AND Y) is equivalent to the disjunction (OR) of the negations of the terms, or ~(X*Y) = ~X + ~Y. An example is shown to demonstrate this identity. - How Boolean algebra can be implemented through digital circuits using

Uploaded by

Tazbir Antu
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
28 views

Boolean Algebra Theory

Boolean algebra allows us to represent and manipulate binary information using logical operations and identities. Some key concepts covered include: - Using Boolean identities like distribution, inverse, and identity laws to simplify expressions in a similar way as algebraic simplification. Examples show rewriting expressions like ~xyz + ~xy~z + xz as ~xy + xz. - DeMorgan's law, which states that the negation of a conjunction (X AND Y) is equivalent to the disjunction (OR) of the negations of the terms, or ~(X*Y) = ~X + ~Y. An example is shown to demonstrate this identity. - How Boolean algebra can be implemented through digital circuits using

Uploaded by

Tazbir Antu
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 3

Boolean Algebra

• We have seen how we can represent information


in binary, now we will explore
– Why we use binary
– How to compute using binary
– How to implement binary operations using Boolean
algebra (such as binary addition)
– How to implement Boolean algebra through digital
circuits
– How to store things using digital circuits
• We will explore logic gates and use these to implement
basic combinational circuits for adding, comparing, etc
and sequential circuits for storage
Basic Boolean Identities
• As with algebra, there will be Boolean operations that
we will want to simplify
– We apply the following Boolean identities to help
• For instance, in algebra, x = y * (z + 0) + (z * 0) can be simplified to
just x = y * z
Some Examples
Example: use algebraic simplification rules to reduce ~xyz+~xy~z+xz
~xyz + ~xy~z + xz = ~xy(z+~z)+xz (distributive law) =
~xy(1)+xz (inverse law) = ~xy+xz (identity law)

Example: xy+~xz+yz = xy+~xz+yz*1 (identity) = xy+~xz+yz*(x+~x)


(inverse) = xy+~xz+xyz+~xyz (distributive) = xy(1+z)+~xz(y+1)
(distributive) = xy(1)+~xz(1) (null) = xy*1+~xz*1 (absorption)
= xy+~xz (identity)

Example: (x+y)(~x+y) = ~x(x+y)+y(x+y) (distributive) = ~xx+~xy+xy+yy (distributive)


= 0+~xy+xy+yy (inverse) = ~xy+xy+yy (identity) = y(~x+x+y) (distributive)
= y(1+y) (inverse) = y(1) (identity) = y (idempotent)

Here we have an example specifically to see how DeMorgan’s Law works


DeMorgan’s Law states that
~(X*Y) = ~X+~Y

Boolean expressions are equal


if their truth tables give the
same values – we see that here

You might also like