Professional Documents
Culture Documents
Level I - Semester 1
0.0=0
1+1=1
0+0=0
1.1=1
1.0=0.1=0
1+0=0+1=1
Source - Linda Null and Julia Lobur, Essentials of Computer Organization and Architecture, 5th Edition
▪ . A.B + A.B = A
( A + B )( A + B ) = A
▪ . A+0 = A
A.0 = 0
▪ . A + A.B = A + B
A( A + B ) = AB
• Ex.
𝐹 𝑥, 𝑦, 𝑧 = 𝑥. 𝑦. 𝑧ҧ + 𝑦.
ത𝑧
• Ex.
𝐹 𝑥, 𝑦, 𝑧 = 𝑥. 𝑦. 𝑧ҧ + 𝑦.
ത𝑧
𝒙 𝒚 𝒛 𝑭
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 0
𝐹 = 𝑥.ҧ 𝑦 + 𝑦.
ത (𝑥 + 𝑧)ҧ + 𝑥. 𝑦.
ത 𝑧+𝑦
𝐹 = 𝑦. 𝑥 + 𝑧. 𝑦ത . 𝑥ҧ + 𝑦ത + 𝑧ҧ
X = A.B + A.B + AB
A B X
0 0
0 1
1 0
1 1
A B X
X = ( A.B ) + ( A.B ) + ( A.B ) 0 0 1
A = 1, A = 0 0 1 1
B = 1, B = 0 1 0 0
1 1 1
A B X
Y = ( A + B ).( A + B ) 0 0 1
A = 0, A = 1 0 1 1
B = 0, B = 1 1 0 0
1 1 0
f ( ABCD ) = ( A + B + C ) + ( A + B + C + D ) + ( A + B + D ) + ( A + C )
▪ The SOP has one term for each 1, and the POS has
one term for each 0
f ( ABC ) = ( A + B + C )( A + BC )
f ( ABC ) = ( A + B + C )( A + BC )
f ( ABC ) = AA + A BC + A B + B BC + AC + BC C
f ( ABC ) = A(1 + BC + B + C ) + BC + BC C
f ( ABC ) = A + BC
n
▪ The map is an array of 2 squares, representing the
possible combinations of values of n binary variables
A 0 1
B
0 0 1
1 1 1
X = A.B + A.B + AB
00 01 11 10
1 1
F = AB + AB
AB 00 01 11 10
C
0 1 1 0 0
1 0 0 1 1
01 0 1 1 0
11 0 1 1 0
10 0 1 0 1
AB 00 01 11 10
C
0 0 1 0 0
1 1 1 0 1
AB 00 01 11 10
C
0 0 1 0 0
1 1 1 0 1
AB 00 01 11 10
CD
00 1 0 0 1
01 0 1 1 0
11 0 0 1 0
10 1 0 0 1
B D + BC D + ABD
AB 00 01 11 10
CD
00 1 0 0 1
01 0 1 1 0
11 0 0 1 0
10 1 0 0 1
( B + D).( B + D).( A + C + D)
AB 00 01 11 10
CD
00 1 0 0 1
01 0 1 1 0
11 0 0 1 0
10 1 0 0 1
CD
CD
AB
CD
AB
BCD
CD
1 1
AB
CD
1 1
AB
ABD
CD
1 1 1 1
AB
CD
1 1 1 1
AB
AB
CD
1 1
AB
1 1
CD
1 1
AB
BC
1 1
CD
1 1 1 1
1 1 1 1
AB
CD
1 1 1 1
1 1 1 1
AB
A
CD
1 1
1 1
AB
1 1
1 1
CD
1 1
1 1
AB
C
1 1
1 1
CD
BC
00 01 11 10
00 01 11 10 00
0 1 1 1
A AB 01
1 1
11 1 1
F = AB + BC 10 1
F = BCD +ACD
CD
0 0 0 0
0 0 0 1
AB
1 1 0 1
1 1 1 1
CD
F = AC + AB + BCD
0 0 0 0
F = (A+C).(A+B).(B+C+D)
0 0 0 1
AB
1 1 0 1
1 1 1 1
B+AC
B+AC
▪ Boolean algebra
▪ Combinational Circuits
▪ AND
▪ OR
▪ NOT
▪ XOR (Exclusive OR)
▪ NOR
▪ NAND
▪ XNOR
A B
0 0
1 1
▪ . Operator
▪ ^ Operator A B A.B
▪ A.B=A^B
0 0 0
0 1 0
1 0 0
1 1 1
▪ + Operator
▪ v Operator A B A+B
▪ A+B=AvB
0 0 0
0 1 1
1 0 1
1 1 1
▪ ~ Operator
▪ ¬ Operator
A A’
0 1
A = A = ~ A = A'
1 0
▪ Operator
A B A B
A B 0 0 0
0 1 1
1 0 1
1 1 0
( A + B) = ( A + B)' A B ( A + B)
0 0 1
0 1 0
1 0 0
1 1 0
( A B) A B ( A B)
0 0 1
0 1 0
1 0 0
1 1 1
X = ( A + B )C
X = A + ( B.C ) + D
X = ( A.B) + ( A.C )
X = ( A + B).(C + D).C
A+B = A.B
A OR B = NOT( ( NOT A) AND ( NOT B) )
A.B = A+B
A AND B = NOT( ( NOT A) OR ( NOT B) )
A A
A A.B
A.B
B
A
A
A
A+B
B
B
NOT
AND
OR
NOR
A A
A A+B
A+B
A
A
A. B
B
B