Question

dale seriäi diagra lor design of a tull adder (fulladder.sch). Full-Adder Full-adder is the basic building block of many arithmetic aircuits. A single ful-adder adds two bits, A and B, and put the results in S. Cn and Cou signals are added to the full-adder circuit to make it usable for adding mulit-bit numbers. The truth table for a full adder circuit is shown below 0 101 0 10 1 0 3. Construct the K maps for all outputs of the above truth table (S to Con). 4. Use the K maps to oblain the minimum expressions for all output (S to Cou), 5. Design the combinational circuit for the derived expressions. 6. Simulate the circuit with all possible inputs to check the circuit's functionality 7. Create a symbol from the devised schematic diagram. a. Inputs: A B, Cin b. Outputs: S, Cout

Please help me with 1-7

Answer 1

From Truth table S = I m (1, 2, 4, 7) C_out = I m (3, 5, 6, 7) (3) By using K - maps: - C^-_in C_in A^- B^- 0 1 A^- B 1 0 A B 0 1 A B^- 1 0 S = A^- B^- C_in + A^- B C^-_in + A B^- C^-_in + A B C_in C_out = A^- B C_in + A B^- C_in + A B C^-_in + A B C_in (4) obtained Expressions: S = A^- B^- C_in + A^- B C^-_in + A B^- C^-_in + A B C_in C_out = A^- B C_in + A B^- C_in + A B C_in (5)