reduction using k-map
reduction using k-map
DIGITAL FUNDAMENTALS
PREPARED BY:
NAJIBULLAH NAYEL
Najibullah 1
INTRODUCTORY DIGITAL CONCEPTS
CHAPTER OUTLINE
➢ Reduction using Karnaugh Map
➢ AND Gate Network
➢ OR Gate Network
➢ NAND Gate Network
➢ NOR Gate Network
Najibullah 2
KARNAUGH MAP
3-VARIABLE KARNAUGH MAP
➢ Three variable Karnaugh map is as follow
Najibullah 3
KARNAUGH MAP
4-VARIABLE KARNAUGH MAP
➢ Four variable Karnaugh map is as follow
Najibullah 4
KARNAUGH MAP
4-VARIABLE KARNAUGH MAP
➢ Reduce the following expression
➢ F=𝐴ҧ𝐵ത 𝐶ҧ 𝐷
ഥ + 𝐴ҧ𝐵𝐶
ത 𝐷ഥ + 𝐴𝐵𝐶ҧ 𝐷 ҧ + 𝐴𝐵
ഥ + 𝐴𝐵𝐶𝐷 ҧ 𝐶𝐷
ҧ + 𝐴𝐵ത 𝐶𝐷
ҧ + 𝐴𝐵𝐶𝐷
ത ഥ
+ 𝐴𝐵𝐶 𝐷
➢ Solution:
Najibullah 5
KARNAUGH MAP
4-VARIABLE KARNAUGH MAP
➢ Solution:
Najibullah 6
KARNAUGH MAP
Najibullah 7
KARNAUGH MAP
4-VARIABLE KARNAUGH MAP
➢ Reduce the following expression
➢ Solution:
Najibullah 8
KARNAUGH MAP
4-VARIABLE KARNAUGH MAP
➢ Reduce the following expression
➢1
➢2
➢3
Najibullah 9
AND GATE
AND GATE
➢ Increasing AND gate inputs
➢ Three inputs
➢ Four inputs
1
Najibullah
0
OR GATE
OR GATE
➢ Increasing OR gate inputs
➢ Three inputs
➢ Four inputs
1
Najibullah
1
NAND GATE
NAND GATE
➢ Increasing OR gate inputs
➢ Three inputs
➢ Four inputs
1
Najibullah
2
NOR GATE
NOR GATE
➢ Increasing OR gate inputs
➢ Three inputs
➢ Four inputs
1
Najibullah
3
Najibullah 14