Problem Set #9 RealDigital
1. (12 points) Sketch a block diagram for a magnitude comparator bit-slice circuit. Create K-maps to
define the bit-slice circuit, and use them to find optimal logic equations. Sketch the bit-slice
circuit.
Real Digital Problem Set 9
2. (12 points) Modify the bit-slice block of problem 1 by removing the logic gates and signals that
form the EQ output. Sketch a "block" circuit diagram for a 4-bit comparator that uses the
modified bit slice blocks, and add a single gate to form the EQ output from the LT and GT outputs
from the MSB (most significant bit).
(4 points) Could you make the bit-slice modules even more efficient by leaving in the EQ logic and
removing some other logic? Explain.
3. (10 points) Complete truth tables and K-maps for HA and FA circuits, using XOR patterns where
appropriate. Loop minimum SOP equations, and sketch the circuits (assume all inputs and outputs
are active high).
Half Adder A B S Cout B B
A 0 1 A 0 1
0 0
0 1 0 0
1 0 1 1
1 1 S Cout
S= Cout =
Real Digital Problem Set 9
Full Adder
B Cin B Cin
A B Cin S Cout 00 01 11 10 00 01 11 10
A A
0 0 0
0 0
0 0 1
0 1 0 1 1
0 1 1 S Cout
1 0 0 S= Cout =
1 0 1
1 1 0
1 1 1
4. (10 points) Sketch a block diagram for a full adder using two half-adder blocks and an OR gate.
5. (8 points) Sketch an entire Carry-Propagate-Generate circuit that can form the carry-ins for all
four bits of 5-bit CLA.
Real Digital Problem Set 9
6. (20 points) Design a full-subtractor bit-slice circuit (Borrow-Ripple Subtractor). Label the inputs A,
B, and Bin, and label the outputs D and Bout. Start by completing the subtraction examples, then
complete the truth table and K-maps, and then sketch the circuit.
...0 0 1 0... ...0 0 1 0... ...0 1 1 0... ...0 1 1 0...
-...1 0 0 0... -...1 1 0 0... -...1 0 0 0... -...1 1 0 0...
...0 0 1 0... ...0 0 1 0... ...0 1 1 0... ...0 1 1 0...
-...1 0 1 0... -...1 1 1 0... -...1 0 1 0... -...1 1 1 0...
A B Bin D Bout B Bin B Bin
A 00 01 11 10 A 00 01 11 10
0 0 0
0 0 1 0 0
0 1 0
0 1 1 1 1
1 0 0 Bout
D
1 0 1 D= Bout =
1 1 0
1 1 1
Real Digital Problem Set 9
7. (8 points) Complete the number conversions indicated. Note that all binary numbers are two’s
complement representations.
-19D = _______________B 10011010 B = ____________ D
10000000 = __________D -101 D = _________________ B
8. (22 points) Complete the four 2’s compliment arithmetic problems below assuming that all
operations use an adder. Showing both the decimal and binary numbers in each case.
17 0 0 0 0 1 0 0 0 1 -22
- 11 + 1 1 1 1 1 0 1 0 1 +6 +
35 19
- 42 + - (-7) +
1 0 1 0 0 1 1 0 Is the answer to the equation on
+ 1 1 1 1 0 1 0 1 the left correct in 8 bits? Explain.
9. (10 points) Sketch a circuit to convert a 4-bit binary number to its 2’s complement representation
using only 3 XOR/XNOR gates and 2 AND or OR gates.
Real Digital Problem Set 9
10. (8 points) Examine several examples of addition overflow and subtraction underflow, and sketch a
circuit below that can output a ‘1’ whenever an addition or subtraction result is incorrect due to
underflow or overflow. Assume that both operands and result of the addition and subtraction are
N-bits. (Hint: compare the carry in and carry out signals of the most-significant bit).
11. (16 points) Fill in the squares below to show all signal values when “1101” and “1010” are
multiplied.
B0 B1 B2 B3 P13 P22 P03 P12 P21 P02 P11 P20 P01 P10 P00
P00 P10 P20 P30 A B A B Cin A B Cin A B
A0 Cout S Cout S Cout S Cout S
P01 P11 P21 P31
A1 P23 P32 P31 P30
P02 P12 P22 P32
A2
P03 P13 P23 P33 A B Cin A B Cin A B Cin A B
A3 Cout S Cout S Cout S Cout S
P33
A3 B3 A2 B2 A1 B1 A0 B0
Cout Cin
R7 R6 R5 R4 R3 R2 R1 R0