CO221 KBS3 Boolean Algebra
CO221 KBS3 Boolean Algebra
. Logic .
Inputs Outputs
Circuit
. .
A Y A Y
A Y
N Y F T
Symbol Y N T F
Input Output
• Negative logic
• 0=5V
• 1=0V
The AND Gate
A
Y
B
be deasserted (low). 1 1 1
The AND Gate
• AND
– AND means that both conditions must be true in
order for the conclusion to be true
A B Y
• This is an OR gate.
0 0 0
• So, if either of the two
0 1 1
input signals are 1 0 1
asserted, or both of 1 1 1
them are, the output
will be asserted.
The OR Gate
3 Input OR Gate
Ordering Boolean Functions
• How to interpret AB+C?
– Is it AB ORed with C ?
– Is it A ANDed with B+C ?
• Order of precedence for Boolean algebra:
AND before OR.
• Note that parentheses are needed here :
Boolean Algebra
• A Boolean algebra is defined as a closed
algebraic system containing a set K or two
or more elements and the two operators, .
and +.
• Useful for identifying and minimizing circuit
functionality
• Identity elements
–a+0=a
–a.1=a
• 0 is the identity element for the +
operation.
• 1 is the identity element for the . operation.
Commutativity and Associativity of the Operators