Question

Design Problem: A1 Ao B1 Bo A=B A>B A<B 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 You have been asked by your manager to design a 2-bit comparator. The comparator compares two 2-bit numbers A (A1 Ao) and B (B1 Bo) and determines whether A=B or A>B or A<B (three outputs). An output will be 1 for only the expression that is true. For example, if A = 10 and B = 11, the outputs would be: A=B 0 A>B 0 A<B 1 (because 01 < 11) 9) Based on this set of requirements, complete the truth table to the left. For questions 9, 10 & 11, use the K-maps below and on the next page. K-Map for A=B K-Map for A>B B1B0 B?Bo 00 01 11 10 00 01 11 10 A1A0 A1A0 00 00 01 01 11 11 10 10 10) Determine the minimized SOP expression for A=B 10) A=B 11) Determine the minimized SOP expression for A>B 11) A>B K-Map for A<B B?Bo 00 01 11 10 A1A0 00 01 11 10 12) Determine the minimized SOP expression for A<B

          Design Problem:
A1 Ao B1 Bo A=B A>B A<B
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1
1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1
You have been asked by your manager to design a 2-bit
comparator. The comparator compares two 2-bit numbers A
(A1 Ao) and B (B1 Bo) and determines whether A=B or A>B
or A<B (three outputs). An output will be 1 for only the
expression that is true.
For example, if A = 10 and B = 11, the outputs would be:
A=B 0
A>B 0
A<B 1 (because 01 < 11)
9) Based on this set of requirements, complete the truth table
to the left.
For questions 9, 10 & 11, use the K-maps below and on
the next page.
K-Map for A=B
K-Map for A>B
B1B0
B?Bo
00 01 11 10
00 01 11 10
A1A0
A1A0
00
00
01
01
11
11
10
10
10) Determine the minimized SOP expression for
A=B
10) A=B
11) Determine the minimized SOP expression for
A>B
11) A>B
K-Map for A<B
B?Bo
00 01 11 10
A1A0
00
01
11
10
12) Determine the minimized SOP expression for
A<B

Design Problem:
A1 Ao B1 Bo A=B A>B A<B
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1
1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1
You have been asked by your manager to design a 2-bit
comparator. The comparator compares two 2-bit numbers A
(A1 Ao) and B (B1 Bo) and determines whether A=B or A>B
or A<B (three outputs). An output will be 1 for only the
expression that is true.
For example, if A = 10 and B = 11, the outputs would be:
A=B 0
A>B 0
A<B 1 (because 01 < 11)
9) Based on this set of requirements, complete the truth table
to the left.
For questions 9, 10 11, use the K-maps below and on
the next page.
K-Map for A=B
K-Map for A>B
B1B0
B?Bo
00 01 11 10
00 01 11 10
A1A0
A1A0
00
00
01
01
11
11
10
10
10) Determine the minimized SOP expression for
A=B
10) A=B
11) Determine the minimized SOP expression for
A>B
11) A>B
K-Map for A<B
B?Bo
00 01 11 10
A1A0
00
01
11
10
12) Determine the minimized SOP expression for
A<B

Added by Dana B.

Question

Please give Ace some feedback