Full adder boolean logic question

  • Thread starter Thread starter david90
  • Start date Start date
  • Tags Tags
    Adder Logic
Click For Summary

Discussion Overview

The discussion revolves around the function and necessity of the carry-in (Cin) input in a full adder circuit, particularly in the context of adding multiple bits. Participants explore the role of Cin in the addition process and question its relevance in specific configurations of full adder circuits.

Discussion Character

  • Technical explanation
  • Conceptual clarification
  • Debate/contested

Main Points Raised

  • One participant questions the purpose of the Cin input in a full adder, suggesting that it could simply be labeled as A, B, C.
  • Another participant explains that Cin represents the carry-in from a less-significant bit's full adder and illustrates its role with an example of binary addition.
  • A participant raises a scenario involving a circuit with four full adders, questioning whether the rightmost full adder would function without a Cin, given that there is no preceding full adder to provide a carry.
  • A later reply reiterates that in a circuit of four full adders, the rightmost full adder would have its Cin grounded, implying it does not need a carry input from a previous adder.

Areas of Agreement / Disagreement

Participants express differing views on the necessity of the Cin input in certain configurations of full adder circuits, indicating that the discussion remains unresolved regarding its role in specific scenarios.

Contextual Notes

Some assumptions about the configuration of the full adder circuit and the handling of carries may not be fully articulated, leading to potential ambiguities in the discussion.

david90
Messages
311
Reaction score
2
Full adder has input A, B and Cin. what is Cin for? Full adder adds 3 bits right?[?] So why not just call the input A,B,C instead of A,B,Cin?
 
Engineering news on Phys.org
A full adder adds two one-bit numbers, A and B. The Cin line is the "carry-in" line, which is asserted when a less-significant bit's full adder overflowed. In other words, in the following problem:

01 + 01

The least significant bit's full adder would be adding 1 + 1, giving an output of zero and a carry of one. That carry would be passed to the next bit to the left, which would add 0 + 0 + the carry bit, producing an output of 1 and a carry of zero.

If you'd like to simply think of the full adder as adding three one-bit numbers, you can, but that's not the clearest way to think of it. There are two carries: Cin, and count.

- Warren
 
say you have a circuit that contains 4 full adder thus it is a circuit that could add 8 bits. Would the circuit still function the same if the far right full adder doesn't have a Cin? What I'm thinking is that why it needs a Cin when there is no full adder before it with count. Not sure if I'm making sense. Thanks for ur respond!:smile:
 
Originally posted by david90
say you have a circuit that contains 4 full adder thus it is a circuit that could add 8 bits. Would the circuit still function the same if the far right full adder doesn't have a Cin? What I'm thinking is that why it needs a Cin when there is no full adder before it with count. Not sure if I'm making sense. Thanks for ur respond!:smile:
A circuit composed of four full-adders can add two four-bit numbers. The rightmost full adder would have its Cin grounded.

- Warren
 

Similar threads

  • · Replies 15 ·
Replies
15
Views
10K
Replies
5
Views
9K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
27K
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K