Design a combinational circuit with four inputs (A, B, C and D) and four outputs (W, X, Y and Z). When the binary input is less than 10 the binary output is two greater than the input. When the binary input is equal or greater than 10 the binary output

Design a combinational circuit with four inputs (A, B, C and D) and four outputs (W, X, Y and Z). When the binary input is less than ten the binary output is two greater than the input. When the binary input is equal or greater than ten the binary output is three less than the input.

Expert Solution

Truth Table :

A	B	C	D	W	X	Y	Z
0	0	0	0	0	0	1	0
0	0	0	1	0	0	1	1
0	0	1	0	0	1	0	0
0	0	1	1	0	1	0	1
0	1	0	0	0	1	1	0
0	1	0	1	0	1	1	1
0	1	1	0	1	0	0	0
0	1	1	1	1	0	0	1
1	0	0	0	1	0	1	0
1	0	0	1	1	0	1	1
1	0	1	0	0	1	1	1
1	0	1	1	1	0	0	0
1	1	0	0	1	0	0	1
1	1	0	1	1	0	1	0
1	1	1	0	1	0	1	1
1	1	1	1	1	1	0	0

Karnaugh map:

W:

AB\CD	00	01	11	10
00	0	0	0	0
01	0	0	1	1
11	1	1	1	1
10	1	1	1	0

W= BC + AC' + AD

X:

AB\CD	00	01	11	10
00	0	0	1	1
01	1	1	0	0
11	0	0	1	0
10	0	0	0	1

X= A'B'C + B'CD' + A'BC' + ABCD

Y:

AB\CD	00	01	11	10
00	1	1	0	0
01	1	1	0	0
11	0	1	0	1
10	1	1	0	1

Y= A'C' + B'C' + C'D + ACD'

Z:

AB\CD	00	01	11	10
00	0	1	1	0
01	0	1	1	0
11	1	0	0	1
10	0	1	0	1

Z= A'D + B'C'D + ACD' + ABD'

Combinational Circuit:

Amanda K answered 2 years ago

Design a combinational circuit that implements a Binary-to-Grey Code converter. Your input should be a four-bit...

Design a combinational circuit that implements a Binary-to-Grey Code converter. Your input should be a four-bit binary number, and your output should be the equivalent four-bit Grey Code value. First, design the circuit using NAND gates only. Next, design the circuit using a minimal number of 2-input XOR gates.

Define a relation ~ on Z x Z such that (a,b) ~ (c,d) precisely when a...

Define a relation ~ on Z x Z such that (a,b) ~ (c,d) precisely when a + b = c + d. Let R = {[(a,b)] : (a,b) in Z x Z} (i.e. R is the set of all equivalence classes of Z x Z under the equivalence relation ~). For each of the following operations, determine whether or not the operation is well defined. Prove your answer. [(x,y)] * [(w, z)] = [(x + w, y + z)] [(x,y)]...

Write a MATLAB assignment statement for each of the following functions, assuming that w, x, y, and z are row vectors of equal length and that c and d are scalars.

X1(t) and x2(t) are two input sources. Design an OPAMP circuit which satisfies the output y(t):...

X1(t) and x2(t) are two input sources. Design an OPAMP circuit which satisfies the output y(t): y(t)= 2x1(t) - 3x2(t) +2V

X=5,Y=7,Z=10 A. if(X<Y): print "LESS" else: print "OTHER" B. if (x == 1): print "ONE" elif...

X=5,Y=7,Z=10 A. if(X<Y): print "LESS" else: print "OTHER" B. if (x == 1): print "ONE" elif (x == 2): print "TWO" elif (x == 3): print "THREE" elif (x == 4): print "FOUR" elif (x == 5): print "FIVE" elif (x == 6): print "SIX" else: print "OTHER" C. if (X<Z): print X X = X + 1 D. while (X<Z): print X X = X + 1 Q11. What is the final value of X in D Q12. Is...

w x y z a 3,2 4,1 2,3 0,4 b 4,4 2,5 1,2 0,4 c 1,3...

w x y z a 3,2 4,1 2,3 0,4 b 4,4 2,5 1,2 0,4 c 1,3 3,1 3,1 4,2 d 5,1 3,1 2,3 1,4 a) for this game, use iterated elimination of strictly dominated strategies. explain each step of your work. b) what strategy profiles survive IESDS? what are the Nash equilibrium of this game?

solve by determinants a.x+y+z=0 3x-y+2z=-1 2x+3y+3z=-5 b. x+2z=1 2x-3y=3 y+z=1 c. x+y+z=10 3x-y=0 3y-2z=-3 d. -8x+5z=-19...

solve by determinants a.x+y+z=0 3x-y+2z=-1 2x+3y+3z=-5 b. x+2z=1 2x-3y=3 y+z=1 c. x+y+z=10 3x-y=0 3y-2z=-3 d. -8x+5z=-19 -7x+5y=4 -2y+3z=3 e. -x+2y+z-5=0 3x-y-z+7=0 -2x+4y+2z-10=0 f. 1/x+1/y+1/z=12 4/x-3/y=0 2/y-1/z=3

Question