PROYECTO

FINAL | DECODER
BCD TO D7S

Juan Mateo Páez Alonso

3er semestre – 3IM5
24 de enero del 2021
Circuitos lógicos combinatorios
M.I.S. Jonatan Belmontes Zacarias
TABLA DE VERDAD
Digito
A B C D f(a) f(b) f(c) f(d) f(e) f(f) f(g)
decimal
0 0 0 0 0 1 1 1 1 1 1 0

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

2 0 0 1 0 1 1 0 1 1 0 1

3 0 0 1 1 1 1 1 1 0 0 1

4 0 1 0 0 0 1 1 0 0 1 1

5 0 1 0 1 1 0 1 1 0 1 1

6 0 1 1 0 1 0 1 1 1 1 1

7 0 1 1 1 1 1 1 0 0 1 0

8 1 0 0 0 1 1 1 1 1 1 1

9 1 0 0 1 1 1 1 1 0 1 1

- 1 0 1 0 x x x x x x x

- 1 0 1 1 x x x x x x x

- 1 1 0 0 x x x x x x x

- 1 1 0 1 x x x x x x x

- 1 1 1 0 x x x x x x x

- 1 1 1 1 x x x x x x x

EXPRESION LOGICA
 f(a) = A’B’C’D’ + A’B’CD’ + A’B’CD + A’BC’D + A’BCD’ + A’BCD + AB’C’D’ + AB’C’D
 f(b) = A’B’C’D’ + A’B’C’D + A’B’CD’ + A’B’CD + A’BC’D’ + A’BCD + AB’C’D’ + AB’C’D
 f(c) = A’B’C’D’ + A’B’C’D + A’B’CD + A’BC’D’ + A’BC’D + A’BCD’ + A’BCD + AB’C’D’ + AB’C’D
 f(d) = A’B’C’D’ + A’B’CD’ + A’B’CD + A’BC’D + A’BCD’ + AB’C’D’ + AB’C’D
 f(e) = A’B’C’D’ + A’B’CD’ + A’BCD’ + AB’C’D’
 f(f) = A’B’C’D’ + A’BC’D’ + A’BC’D + A’BCD’ + A’BCD + AB’C’D’ + AB’C’D
 f(g) = A’B’CD’ + A’B’CD + A’BC’D’ + A’BC’D + A’BCD’ + AB’C’D’ + AB’C’D
MAPA DE KARNAUGH Y EXPRESION LOGICA SIMPLIFICADA
A B
AB|CD 00 01 11 10 AB|CD 00 01 11 10

00 1 0 1 1 1 1
00 1 1
F(a)= 1 0
01 0 1 1 1 01 1 0 F(b)=
A+C+BD+B’D’
x x A+B’+C’D’+CD
11 x x x 11 x x x

10 1 1 x x x
10 1 1 x

C D
AB|CD 00 01 11 10 AB|CD 00 01 11 10

1 00 1 0 1 1
00 1 1 0
1 F(c)= 01 0 1 0 1 F(d)=
01 1 1 1
A+B+D+C’D’ A+B’C+B’D’+BC’D
11 x x x x 11 x x x x

10 1 1 x x 10 1 1 x X

E F
AB|CD 00 01 11 10
AB|CD 00 01 11 10
00 1 0 0 1 1
00 0 0 0
0 0 0 1 F(e)= F(f)=
01
01 1 1 1 1
AB+AC+B’D’CD A+B+C’D’
11 x x x x 11 x x x x
10 1 0 X x 1
10 1 x x

AB|CD 00 01 11 10

00 0 0 1 1
01 F(g)=
G 1 1 0 1
A+BC’+B’C+CD’
11 x x X x

10 1 1 x x
 SIMULACIÓN DEL CIRCUITO LÓGICO

ARMADO DEL CIRCUITO