boolean algebra (binary logic) - the computer science and
TRANSCRIPT
Boolean Algebra (Binary Logic)
{0, 1}
0: Low 0.0 Volt
1: High 5.0 Volt
Boolean Algebra (Binary Logic)
{0, 1}
0: Low 0.0 Volt False OFF
1: High 5.0 Volt True ON
Boolean Algebra (Binary Logic)
Operation
+ : OR
Boolean Algebra (Binary Logic)
Operation
+ : OR 0+0=0 0+1=1 1+0=1 1+1=1
Boolean Algebra (Binary Logic)
Operation
+ : OR 0+0=0 0+1=1 1+0=1 1+1=1
* : AND
Boolean Algebra (Binary Logic)
Operation
+ : OR 0+0=0 0+1=1 1+0=1 1+1=1
* : AND 0*0=0 0*1=0 1*0=0 1*1=1
Boolean Algebra (Binary Logic)
Operation
+ : OR 0+0=0 0+1=1 1+0=1 1+1=1
* : AND 0*0=0 0*1=0 1*0=0 1*1=1
’ : NOT 0’=1 1’=0
Boolean Algebra (Binary Logic)
Operation
+ : OR
* : AND
’ : NOT
Boolean Algebra (Binary Logic)
Circuit
+ : OR
Boolean Algebra (Binary Logic)
Circuit
+ : OR
Timing
Boolean Algebra (Binary Logic)
Timing
I t B
Input A
Input B
Output
Boolean Algebra (Binary Logic)
Circuit
* : AND
Boolean Algebra (Binary Logic)
Circuit
* : AND
Timing
Boolean Algebra (Binary Logic)
Timing
I t B
Input A
Input B
Output
Boolean Algebra (Binary Logic)
Circuit
’ : NOT
Boolean Algebra (Binary Logic)
Circuit
’ : NOTTiming
Boolean Algebra (Binary Logic)
Timing
Input
O t tOutput
TpNOT
Input
Output
0 ns10 ns
X
Y
X = a * b = ab
Y = c * d = cd
z = X + Y = ab + cd
X
s’
Y
X = a * s’ = as’
Y = b * s = bs
z = X + Y = as’ + bs
