Redes y comunicaciones de datos
Laboratorio 03
“circuitos lógicos y simplificación de funciones”
informe
integrantes:
Mendoza Villa, Jimmy
Suarez Aguilar, Javier
Grupo: C16-03-A
Profesor:
De la cruz Berrospi, Javier
Fecha de realización: 25 de Marzo
Fecha de entrega: 01 de Abril
2010 – I
I. IMPLEMENTACIÓN DEUN CIRCUITO LÓGICO A PARTIR DE UNA ECUACIÓN.
a. Para las ecuaciones booleanas que se dan a continuación.
* F = c b + a b’ c d + c d’ + a c’ +a’ b c’ + b’ c’ d’
a) Elabore la tabla lógica
a | b | c | d | cb | ab'cd | cd' | ac' | a'b'c' | b'c'd' | F |
0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 |
0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0| 0 | 1 |
0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 |
0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 |
0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 |
0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 |
1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 |
1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 |
1 | 0 | 1 | 1 | 0 |1 | 0 | 0 | 0 | 0 | 1 |
1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 |
1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 |
1 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 |
1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
b) Minimizar la ecuación
| C’D’ | C’D | CD | CD’ |
A’B’ | 1 | 0 | 0 | 1 |
A’B | 1 | 1 | 1 | 1 |
AB | 1 | 1 | 1 | 1 |
AB’ | 1 | 1 | 1 | 1 |La forma simplificada: (A’ B’ D)’ = A + B + D’
c) Elaborar el circuito lógico basado en cualquier puerta lógica.
a b c d
d) Elaborar el circuito lógico basando en solo NAND o solo NOR.
a b d
* G = Y Z + W X + Z + [ W Z (X Y + W Z)]
1) Elabore la tabla lógica
W | X | Y | Z | YZ | WX | XY | WZ | M | N | G |
0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
0 | 0| 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 0 |
0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 |
1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0| 1 |
1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 |
1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 |
1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 |
1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 |
1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
2) Minimizar la ecuación
| Y’ Z’ | Y’ Z | Y Z | Y Z’ |
W’ X’ | 0 | 1 | 1 | 0 |
W’ X | 0 | 1 | 1 | 0 |W X | 1 | 1 | 1 | 1 |
W X’ | 0 | 1 | 1 | 0 |
La forma simplificada: Z + W X
3) Elaborar el circuito lógico basando en solo NAND o solo NOR.
W X Z
* H = X Y Z + X’ Y Z + X’ Y’ Z’ + X’ Y’ Z + X Y’ Z + X Y’ Z’
1. Elabore la tabla lógica
X | Y | Z | XYZ | X'YZ | X'Y'Z' | X'Y'Z | XY'Z | XY'Z' | H |
0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |0 | 1 |
0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 |
0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 |
1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 |
1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 |
1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
2. Minimizar la ecuación
| Y’ Z’ | Y’ Z | Y Z | Y Z’ |
X’ | 1 | 1 | 1 | 0 |
X | 1 |1 | 1 | 0 |
La forma simplificada: Y’ + Z
3. Elaborar el circuito lógico basando en solo NAND o solo NOR.
Y Z
II. DOCUMENTACION DE UN CIRCUITO COMBINACIONAL
2. Para los circuitos lógicos mostrados a continuación, elaborar:
* CIRCUITO 1
* La tabla lógica
A | B | C | AB’+A’B | F1 | AB | A+B | C(A+B) | F2 |
0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |...
Regístrate para leer el documento completo.