Thursday, October 10, 2019

CS2100: Boolean/Logic Gate

Boolean Algebra

Digital Circuit

- Reliable
- More accurate
- Represented in math
- Ease of design

Basic operation

- Not 
- And (A ^ B)
- Or (A V B)
Not > And > Or

LAWS:





Duality
We can interchange the + and X in all formula and it will still remain the same
Its two for one.
If there are any elements inside, then we have to change the elements.

Logic Gate

Canonical Forms

Is a unique form of representation

Sum of minterms = canonical sum of product
Product of Maxterms = Canonical Product of Sums

MinTerm

A product term but with additional restriction
Must involve all variables in the functions
e.g f(x,y,z)
to be a min term, it must include z,y,x

MaxTerm

A sum term can involve all the variables in the function
Similar to Min term




No comments:

Post a Comment