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 (1100). The outputs for invalid BCD codes are don’t-cares. Write the truth table and the Karnaugh maps used to simplify the Boolean expression!
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here