Produce the expressions to a combinatorial network which should be able to perform 2 simple operations on a 3-bit binary number (two-complement form) X =
s u
0 -x
1 x-1
a) Realize u3 with NOR gates. (diagram need not be drawn)
b) Realize u2 with NAND gates. (diagram need not be drawn)
c) Realize u1 in minimal SP form and draw diagram.
d) Realize u0 with a suitable gate. (the diagram does not need to be drawn).
The following state table is given
a) Solve the task with JK flips and produce the expressions for J and K in SP form.
b) Is it a Mealy or Moore network? (justify the answer)
c) Draw the state diagram.
3. The behavior of the sequence networks below should be determined.
a) Draw up a state table and draw a state graph. (q2 is most significant).
b) Minimize the expression to q+1 PS-form
in PS form and with NOR gates. (not schedule)