Engineering Optimizing Full Adder Circuit: Truth Table & Gate Count Reduction Tips

  • Thread starter Thread starter The Jargon
  • Start date Start date
  • Tags Tags
    Adder Circuit
AI Thread Summary
The discussion presents a truth table for a full adder circuit, detailing inputs A, B, and Cin, along with outputs Sum and Cout. The user shares derived equations for Sum and Cout based on Karnaugh maps, specifically Sum = A + B + Cin and Cout = A.B + Cin(A + B). The user inquires about further reducing gate count by sharing terms between the output functions. Ultimately, the user resolves the query independently. The conversation highlights the importance of optimizing digital circuits for efficiency.
The Jargon
Messages
11
Reaction score
0
Heres my truth table

Code:
A|B|Cin|Sum|Cout
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1

Here's my two equations from the K-maps

Sum = A+B+CIn
Cout = A.B+CIn(A+B)

Now what I want to ask is, is there a way the gate count be reduced further by sharing terms between the two output functions?

Thanks.
 
Last edited by a moderator:
Physics news on Phys.org
Nvm figured it out.
 
Back
Top