Design a circuit with a 4-bit BCD input A, B, C, D that produces an output W, X, Y, Z that is equal to the input + 3 in binary. For example, 9 (1001) + 3 (0011) = 12 (

Design a code converter that converts an unsigned number a into its negative 2's complement representation -a. Specifically, the circuit has two inputs: a1 and ao, and three outputs: b1 and bo (the equivalent to -a) and valid, which is 1 when -a can be represented in 2's complement and O otherwise. 1. Write the truth table for the code converter. 2. Give the simplest SOP expressions for the functions b1, bo, and valid.

8. For the K-map below, ONLY write the simplified expression, and then draw the simplest possible circuit. yz 00 01 11 10 00 1 1 WX 01 1 11 10 1

You are asked to design a circuit to detect if an overflow occurs when subtracting two integers represented in two's complement: Z= X - Y. Let Sz, Sx, and Sy be the sign bit for Z, X, and Y respectively, and they are fed as input to the circuit. Let O be the output bit of the circuit, whose value is 1 if an overflow happens, and 0 if otherwise. a) Build the truth table for O as a Boolean function of Sx, Sy, and Sz. b) Write the canonical expression (sum-of-product) for the Boolean function defined in the part a. c) Implement the Boolean expression defined in part b with a circuit by using AND, OR, and NOT gates. Draw the wiring diagram.