Question: Consider two Boolean functions in sum?of?minterms form: F1(A, B, C, D) = (0, 1, 4, 5, 8, 9, 10, 12, 13) F2(A, B, C, D)
Consider two Boolean functions in sum?of?minterms form:
F1(A, B, C, D) = (0, 1, 4, 5, 8, 9, 10, 12, 13)
F2(A, B, C, D) = (3, 5, 7, 8, 10, 11, 13, 15)
Simplify these functions by means of maps. Obtain a composite logic diagram with four inputs, A, B, C, and D, and two outputs, F1 and F2. Implement the two functions together, using a minimum number of NAND ICs. Do not duplicate the same gate if the corresponding term is needed for both functions. Use any extra gates in existing ICs for inverters when possible. Connect the circuit and check its operation. The truth table for F1 and F2 obtained from the circuit should conform with the minterms listed.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
