2. Diseñar y simular en Proteus un circuito decodificador de 3x8. La salida activa debe ser “1”.

Para una mejor visualización de las salidas, a cada una de ellas conecte un led. Debe elaborar:

2.1) Tabla de verdad

X Y Z DO D1 D2 D3 D4 D5 D6 D7
0 0 0 1 0 0 0 0 0 0 0
0 0 1 0 1 0 0 0 0 0 0
0 1 0 0 0 1 0 0 0 0 0
0 1 1 0 0 0 1 0 0 0 0
1 0 0 0 0 0 0 1 0 0 0
1 0 1 0 0 0 0 0 1 0 0
1 1 0 0 0 0 0 0 0 1 0
1 1 1 0 0 0 0 0 0 0 1

2.2) Funciones reducidas

XY XY XY
Z 00 01 11 10 Z 00 01 11 10 Z 00 01 11 10

0 1 0 0 0 0 0 0 0 0 0 0 1 0 0
1 1
0 0 0 0 1 0 0 0 1 0 0 0 0

D0(X,Y,Z)=∑ 𝑚(0) = 𝑋′𝑌′𝑍′ D1(X,Y,Z)=∑ 𝑚(1) = 𝑋′𝑌′𝑍 D2(X,Y,Z)=∑ 𝑚(2) = 𝑋′𝑌𝑍′

D0(X,Y,Z)=∏ 𝑀 (0) = 𝑋 ′ 𝑌 ′ 𝑍′ D1(X,Y,Z)=∏ 𝑀 (1) = 𝑋 ′ 𝑌 ′ 𝑍′ D2(X,Y,Z)=∏ 𝑀 (2) = 𝑋 ′ 𝑌𝑍′

XY XY XY
Z 00 01 11 10 Z 00 01 11 10 Z 00 01 11 10

0 0 0 0 0 0 0 0 0 1 0 0 0 0 0
1 1
0 1 0 0 0 0 0 0 1 0 0 0 1

D3(X,Y,Z)=∑ 𝑚(3) = 𝑋′𝑌𝑍 D4(X,Y,Z)=∑ 𝑚(4) = 𝑋𝑌′𝑍 ′ D5(X,Y,Z)=∑ 𝑚(5) = 𝑋𝑌′𝑍

D3(X,Y,Z)=∏ 𝑀 (3) = 𝑋 ′ 𝑌𝑍 D4(X,Y,Z)=∏ 𝑀 (4) = 𝑋𝑌 ′ 𝑍′ D5(X,Y,Z)=∏ 𝑀 (5) = 𝑋𝑌′𝑍

XY XY
Z 00 01 11 10 Z 00 01 11 10

0 0 0 1 0 0 0 0 0 0
1 1
0 0 0 0 0 0 1 0

D6(X,Y,Z)=∑ 𝑚(6) = 𝑋𝑌𝑍′ D7(X,Y,Z)=∑ 𝑚(7) = 𝑋𝑌𝑍

D6(X,Y,Z)=∏ 𝑀 (6) = 𝑋𝑌𝑍′ D7(X,Y,Z)=∏ 𝑀 (7) = 𝑋𝑌𝑍

4. Diseñar y simular en Proteus un circuito comparador, al cual ingresen dos números A y B (de
dos bits cada uno) y que tenga tres salidas, cada una de ellas conectadas a un led. Cada salida
indicará si A=B, A<B y A>B.

4.1) Tabla de verdad

A1 A0 B1 B0 S0(A>B) S1(A<B) S2(A=B)

0 0 0 0 0 0 1
0 0 0 1 0 1 0
0 0 1 0 0 1 0
0 0 1 1 0 1 0
0 1 0 0 1 0 0
0 1 0 1 0 0 1
0 1 1 0 0 1 0
0 1 1 1 0 1 0
1 0 0 0 1 0 0
1 0 0 1 1 0 0
1 0 1 0 0 0 1
1 0 1 1 0 1 0
1 1 0 0 1 0 0
1 1 0 1 1 0 0
1 1 1 0 1 0 0
1 1 1 1 0 0 1

4.2) Funciones reducidas

B1B0
B1B0
A1A0 00 01 11 10
A1A0 00 01 11 10
0 1 1 1
00 0 0 0 0 00
0 0 1 1
01
01 1 0 0 0
0 0 0 0
1 1 1
11
11 0
1 1 0 0 1 0
10
10 0 0
S0(A1,A0,B1,B0)=∑ 𝑚(4,8,9,12,13,15) = A1 (B1 )’+ A0(B1)’(B0)’+ A1 A0 (B0)’ S1(A1,A0,B1,B0)=∑ 𝑚(1,2,3,6,7,11) =(A1)’B1 + (A1)’(A0)’ B0 +

(A0)’B1B0
S0(A1,A0,B1,B0)=∏ 𝑀 (4,8,9,12,13,15) =( A1+ A0)*( (B1)’+(B0)’)*( (B0)’+ A1)

S1(A1,A0,B1,B0)=∏ 𝑀 (1,2,3,16,7,11) =((A1)’+(A0)’)*(B1+ B0)

((A0)’+B1)*((A1)’+B1)

((A1)’+ B0)
 B1B0 00 01 11 10
A1A0
00 1 0 0 0
01 0 1 0 0
11 0 0 1 0
10 0 0 0 1
S2(A1,A0,B1,B0)=∑ 𝑚(0,5,10,15) =(A1 B1)’(A0 B0)’

S2(A1,A0,B1,B0)=∏ 𝑀 (0,5,10,15) =(A1+(B1)’)*((A0)’+B0)*((A1)’+B1)*(A0+B0)

6. Diseñar, simular en Proteus e implementar con compuertas lógicas, un circuito Indicador

de Nivel haciendo uso de 7 leds. De acuerdo a cada combinación se encenderá uno o
varios leds.
6.1) Tabla de verdad
A B C L1 L2 L3 L4 L5 L6 L7
0 0 0
0 0 1 1
0 1 0 1 1
0 1 1 1 1 1
1 0 0 1 1 1 1
1 0 1 1 1 1 1 1
1 1 0 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1

6.2)Funciones reducidas

AB 00 01 11 10
AB 00 01 11 10
C C
0 0 1 1 1
0 0 1 1 1

1 1 1 1 1 1 0 1 1 1

L1(A,B,C)=∑ 𝑚(1,2,3,4,5,6,7) =A+B+C L2(A,B,C)=∑ 𝑚(2,3,4,5,6,7) =A+B

L1(A,B,C)=∏ 𝑀 (1,2,3,4,5,6,7) =A+B+C L2(A,B,C)=∏ 𝑀 (2,3,4,5,6,7) =A+B

AB 00 01 11 10
AB 00 01 11 10
C
C
0 0 0 1 1
0 0 1 1
0
1 0 0 1 1
1 0 1 1 1

L3(A,B,C)=∑ 𝑚(3,4,5,6,7) =A+BC L4(A,B,C)=∑ 𝑚(4,5,6,7) =A

L3(A,B,C)=∏ 𝑀 (3,4,5,6,7) =(A+C)(A+B) L4(A,B,C)=∏ 𝑀 (4,5,6,7) =A

AB 00 01 11 10
C
0 0 1 0
0
1 0 0 1 1

L5(A,B,C)=∑ 𝑚(5,6,7) =AC+AB

L5(A,B,C)=∏ 𝑀 (5,6,7) =A(B+C)

 AB 00 01 11 10 AB 00 01 11 10
C C
0 0 0 1 0 0 0 0 0 0

1 0 0 1 0 1 0 0 1 0

L6(A,B,C)=∑ 𝑚(6,7) =AB L7(A,B,C)=∑ 𝑚(7) =ABC

L6(A,B,C)=∏ 𝑀 (6,7) =(A)(B) L4(A,B,C)=∏ 𝑀 (7) =(A)(B)(C)