Scribd
Upload
57 views7 pages

Electronica Problema 2

The document describes a 3-bit comparator circuit that compares two 3-bit numbers, A and B, and outputs the results of A>B, A<B, and A=B. It then provides a truth table that lists all possible combinations of the 3-bit inputs for A and B and the corresponding outputs.

Uploaded by

Oscar Omar Santander Moncayo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
57 views7 pages

Electronica Problema 2

The document describes a 3-bit comparator circuit that compares two 3-bit numbers, A and B, and outputs the results of A>B, A<B, and A=B. It then provides a truth table that lists all possible combinations of the 3-bit inputs for A and B and the corresponding outputs.

Uploaded by

Oscar Omar Santander Moncayo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

PROBLEMA 2:

Se tiene un comparador de dos números (A y B) de tres bits cada uno. Las salidas (S0,
S1 y S2) toman el valor lógico de "1" cuando A>B, A<B,A=B.

B A
32 16 8 4 2 1
U V W X Y Z
0 0 0 0 0 0
0 0 0 0 0 1
0 0 0 0 1 0
0 0 0 0 1 1
0 0 0 1 0 0
0 0 0 1 0 1
0 0 0 1 1 0
0 0 0 1 1 1
0 0 1 0 0 0
0 0 1 0 0 1
0 0 1 0 1 0
0 0 1 0 1 1
0 0 1 1 0 0
0 0 1 1 0 1
0 0 1 1 1 0
0 0 1 1 1 1
0 1 0 0 0 0
0 1 0 0 0 1
0 1 0 0 1 0
0 1 0 0 1 1
0 1 0 1 0 0
0 1 0 1 0 1
0 1 0 1 1 0
0 1 0 1 1 1
0 1 1 0 0 0
0 1 1 0 0 1
0 1 1 0 1 0
0 1 1 0 1 1
0 1 1 1 0 0
0 1 1 1 0 1
0 1 1 1 1 0
0 1 1 1 1 1
1 0 0 0 0 0
1 0 0 0 0 1
1 0 0 0 1 0
1 0 0 0 1 1
1 0 0 1 0 0
1 0 0 1 0 1
1 0 0 1 1 0
1 0 0 1 1 1
1 0 1 0 0 0
1 0 1 0 0 1
1 0 1 0 1 0
1 0 1 0 1 1
1 0 1 1 0 0
1 0 1 1 0 1
1 0 1 1 1 0
1 0 1 1 1 1
1 1 0 0 0 0
1 1 0 0 0 1
1 1 0 0 1 0
1 1 0 0 1 1
1 1 0 1 0 0
1 1 0 1 0 1
1 1 0 1 1 0
1 1 0 1 1 1
1 1 1 0 0 0
1 1 1 0 0 1
1 1 1 0 1 0
1 1 1 0 1 1
1 1 1 1 0 0
1 1 1 1 0 1
1 1 1 1 1 0
1 1 1 1 1 1
A>B A<B A=B
A B S0 S1 S2
0 0 0 0 1
1 0 1 0 0
2 0 1 0 0
3 0 1 0 0
4 0 1 0 0
5 0 1 0 0
6 0 1 0 0
7 0 1 0 0
0 1 0 1 0
1 1 0 0 1
2 1 1 0 0
3 1 1 0 0
4 1 1 0 0
5 1 1 0 0
6 1 1 0 0
7 1 1 0 0
0 2 0 1 0
1 2 0 1 0
2 2 0 0 1
3 2 1 0 0
4 2 1 0 0
5 2 1 0 0
6 2 1 0 0
7 2 1 0 0
0 3 0 1 0
1 3 0 1 0
2 3 0 1 0
3 3 0 0 1
4 3 1 0 0
5 3 1 0 0
6 3 1 0 0
7 3 1 0 0
0 4 0 1 0
1 4 0 1 0
2 4 0 1 0
3 4 0 1 0
4 4 0 0 1
5 4 1 0 0
6 4 1 0 0
7 4 1 0 0
0 5 0 1 0
1 5 0 1 0
2 5 0 1 0
3 5 0 1 0
4 5 0 1 0
5 5 0 0 1
6 5 1 0 0
7 5 1 0 0
0 6 0 1 0
1 6 0 1 0
2 6 0 1 0
3 6 0 1 0
4 6 0 1 0
5 6 0 1 0
6 6 0 0 1
7 6 1 0 0
0 7 0 1 0
1 7 0 1 0
2 7 0 1 0
3 7 0 1 0
4 7 0 1 0
5 7 0 1 0
6 7 0 1 0
7 7 0 0 1
XYZ
000 001 011 010 110 111 101 100
000 0 1 1 1 1 1 1 1
001 0 0 1 1 1 1 1 1
011 0 0 0 0 1 1 1 1
uvw
010 0 0 1 0 1 1 1 1
110 0 0 0 0 0 1 0 0
111 0 0 0 0 0 0 0 0
101 0 0 0 0 1 1 0 0
100 0 0 0 0 1 1 1 0

F= U'X + U'V'Y + V'XY + U'V'W'Z + U'W'YZ + V'W'XZ + W'XYZ


XYZ
000 001 011 010 110 111 101 100
000 0 0 0 0 0 0 0 0
001 1 0 0 0 0 0 0 0
011 1 1 0 1 0 0 0 0
uvw

010 1 1 0 0 0 0 0 0
110 1 1 1 1 0 0 1 1
111 1 1 1 1 1 0 1 1
101 0 1 1 1 0 0 0 1
100 1 1 1 1 0 0 0 0

F= VW'Y' + VWX + UVX' + U'VXZ' + UV'W'X + UXY'Z' + V'WX'Y'Z'


XYZ
000 001 011 010 110 111 101 100
000 1 0 0 0 0 0 0 0
001 0 1 0 0 0 0 0 0
uvw 011 0 0 1 0 0 0 0 0
010 0 0 0 1 0 0 0 0
110 0 0 0 0 1 0 0 0
111 0 0 0 0 0 1 0 0
101 0 0 0 0 0 0 1 0
100 0 0 0 0 0 0 0 1

F= U'V'W'X'Y'Z' + U'V'WX'Y'Z + U'VW'X'YZ' + U'VWX'YZ +


UV'W'XY'Z' + UV'WXY'Z + UVW'XYZ' + UVWXYZ

You might also like