Formas Canónicas

O Implementar la siguientes funciones

booleanas, previa simplificación, solo con
compuertas NAND y luego solo con
compuertas NOR.
1. 𝐹 𝐴, 𝐵, 𝐶, 𝐷 = σ 0,1,2,4,6,7,9,14,15
2. 𝐹 𝐴, 𝐵, 𝐶, 𝐷 = σ 1,3,7,8,9,10,11,15
3. 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = σ 0,4,5,6,7,8,12,13,14,15
1. 𝐹 𝐴, 𝐵, 𝐶, 𝐷 = σ 0,1,2,4,6,7,9,14,15

𝐹
= 𝐴ҧ𝐵ത 𝐶ҧ 𝐷
ഥ + 𝐴ҧ𝐵ത 𝐶𝐷
ҧ + 𝐴ҧ𝐵𝐶
ത 𝐷 ҧ 𝐶ҧ 𝐷
ഥ + 𝐴𝐵 ҧ 𝐷
ഥ + 𝐴𝐵𝐶 ҧ
ഥ + 𝐴𝐵𝐶𝐷
+ 𝐴𝐵ത 𝐶𝐷ҧ + 𝐴𝐵𝐶 𝐷 ഥ + 𝐴𝐵𝐶𝐷

𝐹 = 𝐴ҧ𝐵ത 𝐶ҧ + 𝐴𝐵𝐶
ҧ + 𝐴𝐵𝐶 + 𝐴ҧ𝐵ത 𝐷 ҧ 𝐷
ഥ + 𝐴𝐵 ҧ
ഥ + 𝐵ത 𝐶𝐷

𝐹 = 𝐴ҧ𝐵ത 𝐶ҧ + 𝐵𝐶 + 𝐴ҧ𝐷 ҧ
ഥ + 𝐵ത 𝐶𝐷

𝐹 = 𝐵ത 𝐶ҧ 𝐴ҧ + 𝐷 + 𝐵𝐶 + 𝐴ҧ𝐷
ഥ

𝐹 = 𝐵ത 𝐶ҧ 𝐴𝐷
ഥ 𝐵𝐶 𝐴ҧ𝐷
ഥ
Implementado en circuito con
puros NAND
1. 𝐹 𝐴, 𝐵, 𝐶, 𝐷 = σ 0,1,2,4,6,7,9,14,15

𝐹 = 𝐵ത 𝐶ҧ 𝐴ҧ + 𝐷 + 𝐵𝐶 + 𝐴ҧ𝐷
ഥ

𝐹 = 𝐵 + 𝐶 + 𝐴ҧ + 𝐷 + 𝐵ത + 𝐶ҧ + 𝐴 + 𝐷
Implementando el circuito con
puros NOR
2. 𝐹 𝐴, 𝐵, 𝐶, 𝐷 = σ 1,3,7,8,9,10,11,15

𝐹
= 𝐴ҧ𝐵ത 𝐶𝐷
ҧ + 𝐴ҧ𝐵𝐶𝐷
ത ҧ
+ 𝐴𝐵𝐶𝐷 + 𝐴𝐵ത 𝐶ҧ 𝐷 ҧ + 𝐴𝐵𝐶
ഥ + 𝐴𝐵ത 𝐶𝐷 ത 𝐷ഥ
ത
+ 𝐴𝐵𝐶𝐷 + 𝐴𝐵𝐶𝐷

ҧ + 𝐵𝐶𝐷
𝐹 = 𝐵ത 𝐶𝐷 ത + 𝐴𝐵ത 𝐷
ഥ + 𝐵𝐶𝐷

ത + 𝐶𝐷 + 𝐴𝐵ത 𝐷
𝐹 = 𝐵𝐷 ഥ

𝐹 = 𝐷 𝐵ത + 𝐶 + 𝐴𝐵ത 𝐷
ഥ

𝐹 = 𝐷 𝐵𝐶ҧ 𝐴𝐵ത 𝐷
ഥ
Implementado en circuito con
puros NAND
2. 𝐹 𝐴, 𝐵, 𝐶, 𝐷 = σ 1,3,7,8,9,10,11,15

𝐹 = 𝐷 𝐵ത + 𝐶 + 𝐴𝐵ത 𝐷
ഥ

ഥ + 𝐵ത + 𝐶 + 𝐴ҧ + 𝐵 + 𝐷
𝐹=𝐷
Implementando el circuito con
puros NOR
3. 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = σ 0,4,5,6,7,8,12,13,14,15

𝐹
= 𝐴ҧ𝐵ത 𝐶ҧ 𝐷 ҧ 𝐶ҧ 𝐷
ഥ + 𝐴𝐵 ҧ 𝐶𝐷
ഥ + 𝐴𝐵 ҧ + 𝐴𝐵𝐶
ҧ 𝐷 ҧ
ഥ + 𝐴𝐵𝐶𝐷 + 𝐴𝐵ത 𝐶ҧ 𝐷
ഥ
+ 𝐴𝐵𝐶ҧ 𝐷 ഥ + 𝐴𝐵𝐶𝐷ҧ + 𝐴𝐵𝐶 𝐷 ഥ + 𝐴𝐵𝐶𝐷

𝐹 = 𝐵ത 𝐶ҧ 𝐷 ҧ 𝐶ҧ + 𝐴𝐵𝐶
ഥ + 𝐴𝐵 ҧ + 𝐴𝐵𝐶ҧ + 𝐴𝐵𝐶

𝐹 = 𝐵ത 𝐶ҧ 𝐷 ҧ + 𝐴𝐵
ഥ + 𝐴𝐵

𝐹 = 𝐵ത 𝐶ҧ 𝐷
ഥ+𝐵

𝐹 = 𝐵ത 𝐶ҧ 𝐷
ഥ 𝐵ത
Implementado en circuito con
puros NAND
3. 𝐹 = σ 0,4,5,6,7,8,12,13,14,15

𝐹 = 𝐵ത 𝐶ҧ 𝐷
ഥ+𝐵

𝐹 = 𝐵+𝐶+𝐷 +𝐵
Implementando el circuito con
puros NOR
Implementar las siguientes funciones booleanas, previa
simplificación, sólo con compuertas NAND y luego
sólo con compuertas NOR:

1.-) F (A,B,C,D)= ∏ (0,1,7,8,9,15)

2.-) F (A,B,C,D)= ∏ (0,1,2,3,12,13,14,15)
3.-) F (A,B,C,D)= ∏ (0,8,9,11,15)
1.-) F (A,B,C,D)= ∏ (0,1,7,8,9,15)
SOLUCION

∏ (M0, M1, M7, M8, M9, M15)

F (A,B,C,D)= M0 . M1 . M7 . M8 . M9 . M15

𝐹 = 𝐴+𝐵+𝐶+𝐷 𝐴+𝐵+𝐶+𝐷 ഥ 𝐴 + 𝐵ത + 𝐶ҧ + 𝐷ഥ 𝐴ҧ + 𝐵 + 𝐶 + 𝐷
(𝐴ҧ + 𝐵 + 𝐶 + 𝐷)(
ഥ 𝐴ҧ + 𝐵ത + 𝐶ҧ + 𝐷)
ഥ

Ordenando
𝐹 = 𝐴 + 𝐵 + 𝐶 + 𝐷 𝐴ҧ + 𝐵 + 𝐶 + 𝐷 𝐴 + 𝐵 + 𝐶 + 𝐷 ഥ 𝐴ҧ + 𝐵 + 𝐶 + 𝐷
ഥ
(𝐴 + 𝐵ത + 𝐶ҧ + 𝐷)(
ഥ 𝐴ҧ + 𝐵ത + 𝐶ҧ + 𝐷)
ഥ

Operando

𝐹 = 𝐵+𝐶+𝐷 𝐵+𝐶+𝐷 ഥ 𝐵ത + 𝐶ҧ + 𝐷
ഥ
𝐹 = 𝐵 + 𝐶 𝐵ത + 𝐶ҧ + 𝐷
ഥ
𝐹 = 𝐵 + 𝐶 . 𝐵𝐶𝐷
𝐹 = 𝐵 𝐶𝐷 + 𝐶(𝐵𝐷)
N° A B C D F
0 0 0 0 0 0
1 0 0 0 1 0
2 0 0 1 0 1
3 0 0 1 1 1
4 0 1 0 0 1
5 0 1 0 1 1
6 0 1 1 0 1
7 0 1 1 1 0
8 1 0 0 0 0
9 1 0 0 1 0
10 1 0 1 0 1
11 1 0 1 1 1
12 1 1 0 0 1
13 1 1 0 1 1
14 1 1 1 0 1
15 1 1 1 1 0
IMPLEMENTANDO EL CIRCUITO CON PUROS NAND
IMPLEMENTANDO EL CIRCUITO CON PUROS NOR
2.-) F (A,B,C,D)= ∏ (0,1,2,3,12,13,14,15)
SOLUCION

ෑ(𝑀0 , 𝑀1 , 𝑀2 , 𝑀3 , 𝑀12 , 𝑀13 , 𝑀14 , 𝑀15 )

𝐹 = 𝑀0 . 𝑀1 . 𝑀2 . 𝑀3 . 𝑀12 . 𝑀13 . 𝑀14 . 𝑀15

𝐹 = 𝐴+𝐵+𝐶+𝐷 𝐴+𝐵+𝐶+𝐷 ഥ 𝐴 + 𝐵 + 𝐶ҧ + 𝐷 𝐴 + 𝐵 + 𝐶ҧ + 𝐷 ഥ
𝐴ҧ + 𝐵ത + 𝐶 + 𝐷 (𝐴ҧ + 𝐵ത + 𝐶 + 𝐷)(
ഥ 𝐴ҧ + 𝐵ത + 𝐶ҧ + 𝐷)(𝐴ҧ + 𝐵ത + 𝐶ҧ + 𝐷)
ഥ

ҧ 𝐴ҧ + 𝐵ത + 𝐶)(𝐴ҧ + 𝐵ത + 𝐶)ҧ
𝐹 = (𝐴 + 𝐵 + 𝐶)(𝐴 + 𝐵 + 𝐶)(

𝐹 = (𝐴 + 𝐵)(𝐴ҧ + 𝐵)
ത

𝐹 = 𝐵 𝐴ҧ + 𝐴𝐵ത
N° A B C D F

0 0 0 0 0 0

1 0 0 0 1 0

2 0 0 1 0 0

3 0 0 1 1 0

4 0 1 0 0 1

5 0 1 0 1 1

6 0 1 1 0 1

7 0 1 1 1 1

8 1 0 0 0 1

9 1 0 0 1 1

10 1 0 1 0 1

11 1 0 1 1 1

12 1 1 0 0 0

13 1 1 0 1 0

14 1 1 1 0 0

15 1 1 1 1 0
IMPLEMENTANDO EL CIRCUITO CON PUROS NAND
IMPLMENTANDO EL CIRCUITO CON PUROS NOR
 3.-) F (A,B,C,D)= ∏ (0,8,9,11,15)

SOLUCION

ෑ(𝑀0 , 𝑀8 , 𝑀9 , 𝑀11 , 𝑀15 )

𝐹 = 𝑀0 . 𝑀8 . 𝑀9 . 𝑀11 . 𝑀15
𝐹 = (𝐴 + 𝐵 + 𝐶 + 𝐷)(𝐴ҧ + 𝐵 + 𝐶 + 𝐷)(𝐴ҧ + 𝐵 + 𝐶 + 𝐷)(
ഥ 𝐴ҧ + 𝐵 + 𝐶ҧ + 𝐷
ഥ )(𝐴ҧ + 𝐵ത + 𝐶ҧ + 𝐷
ഥ)
𝐹 = (𝐵 + 𝐶 + 𝐷) 𝐴ҧ + 𝐷
ഥ + (𝐵 + 𝐶)(𝐵 + 𝐶)ҧ (𝐴ҧ + 𝐵ത + 𝐶ҧ + 𝐷
ഥ)

𝐹 = (𝐵 + 𝐶 + 𝐷)(𝐴ҧ + 𝐵 + 𝐷
ഥ )(𝐴ҧ + 𝐵ത + 𝐶ҧ + 𝐷
ഥ)

𝐹 = (𝐵 + 𝐶 + 𝐷) 𝐴ҧ + 𝐷
ഥ + 𝐵(𝐵ത + 𝐶)ҧ

𝐹 = 𝐵 + 𝐶 + 𝐷 (𝐴ҧ + 𝐷
ഥ + 𝐵 𝐶)ҧ
N° A B C D F

0 0 0 0 0 0

1 0 0 0 1 1

2 0 0 1 0 1

3 0 0 1 1 1

4 0 1 0 0 1

5 0 1 0 1 1

6 0 1 1 0 1

7 0 1 1 1 1

8 1 0 0 0 0

9 1 0 0 1 0

10 1 0 1 0 1

11 1 0 1 1 0

12 1 1 0 0 1

13 1 1 0 1 1

14 1 1 1 0 1

15 1 1 1 1 0
IMPLEMENTANDO CON PUROS NAND
IMPLEMENTANDO CON PUROS NOR