2-bit Bin Full Adder Truth Table Derivation

In summary, you are having trouble deriving the truth table of a 2 bit adder. You are trying to figure out which bit is which, and the table makes sense in that way.
  • #1
jisbon
476
30
Homework Statement
-
Relevant Equations
-
Hi all,
I am having some troubles deriving the truth table of the following:
I don't understand how does one gets to the highlight parts. For example, 10 10, when the carry is low, shouldn't the output be 0 0 1?
1602913999172.png

I fully understand how to add if it is a single bit, but now with 2 bits, it is a bit confusing and I can't seem to find any resources online to learn about this :( Any help will be appreciated.
 
Physics news on Phys.org
  • #2
Adding two + two bits is just adding one + one bits twice: two single bit full adders.

For a single bit adder, you have three inputs and two outputs.
So the sum is 0, 1, 2, or 3 ie. 00,01,10, or 11.
The LSB out is the bit value and the MSB is the carry.

If you work out the table for the first bit, then for the second bit, you can combine the relevant rows to get the two bit table.
adder2bit.png

I think the confusing factor in this question isthat they treat the C0 input as in some way different from the A and B inputs. To me, all three inputs to a full adder are equivalent. C0 is just another input along with A1 and B1.
 
  • #3
Maybe I've jumped the gun! Looking at the example in your comment,
jisbon said:
I don't understand how does one gets to the highlight parts. For example, 10 10, when the carry is low, shouldn't the output be 0 0 1?
Looking at your specific example 10 + 10 = 100 it seems your problem may be knowing which bit is which.

In the table it seems to me that bit 1 is LSB and bit 2 is MSB, so
10 + 10 is A1=0, B1=0 , both LSBs; A2=1, B2=1, both MSBs; and the output is LSB S1=0, S2=0 and C2=1 new MSB
That would be the 6th line in the table where C0=0.
 
  • #4
Merlin3189 said:
Maybe I've jumped the gun! Looking at the example in your comment,

Looking at your specific example 10 + 10 = 100 it seems your problem may be knowing which bit is which.

In the table it seems to me that bit 1 is LSB and bit 2 is MSB, so
10 + 10 is A1=0, B1=0 , both LSBs; A2=1, B2=1, both MSBs; and the output is LSB S1=0, S2=0 and C2=1 new MSB
That would be the 6th line in the table where C0=0.
Oh so I'm reading the table wrongly? 10 +10 is indeed 001?
 
  • #5
That's my view. It seems a reasonable interpretation and the table makes sense that way.
A and B are the two data streams. A1 and B1 are LSB, A2 and B2 MSB, C0 is the carry in and
for output S1 is bit 0, S2 is bit 1 and C2 is carry out, where bit 0 means LSB.
adder2bitMirror.png

As I said, I don't like the layout of the table, but I can make sense of it if I understand it in this way.
It is always a problem (IMO) withthese things, that we all have our own way of mapping hardware to semantics. Big endians and little endians caused endless (!) trouble in my day.
 

1. What is a 2-bit bin full adder truth table?

A 2-bit bin full adder truth table is a table that shows the output of a 2-bit binary full adder for all possible combinations of input bits. It is used to determine the correct output for addition operations in binary arithmetic.

2. How is a 2-bit bin full adder truth table derived?

A 2-bit bin full adder truth table is derived by considering all possible combinations of input bits and using the rules of binary addition to determine the correct output. This involves breaking down the addition process into smaller steps and considering the carry bit from the previous step.

3. What are the inputs and outputs of a 2-bit bin full adder truth table?

The inputs of a 2-bit bin full adder truth table are the two binary digits being added (A and B) and the carry bit from the previous step (C). The outputs are the sum of the two digits (S) and the carry bit for the next step (Cout).

4. Why is a 2-bit bin full adder truth table important in computer science?

A 2-bit bin full adder truth table is important in computer science because it is a fundamental component of binary arithmetic, which is the basis of all digital computing. It is used in the design of computer processors and other digital circuits to perform addition operations.

5. Can a 2-bit bin full adder truth table be expanded to handle larger numbers?

Yes, a 2-bit bin full adder truth table can be expanded to handle larger numbers by adding more input bits and considering the carry bit from each step. This allows for the addition of binary numbers with any number of digits, making it a versatile tool in computer science.

Similar threads

  • Set Theory, Logic, Probability, Statistics
2
Replies
45
Views
3K
  • Engineering and Comp Sci Homework Help
Replies
6
Views
17K
  • Engineering and Comp Sci Homework Help
Replies
1
Views
2K
  • Programming and Computer Science
Replies
1
Views
675
  • Engineering and Comp Sci Homework Help
Replies
6
Views
5K
  • Engineering and Comp Sci Homework Help
Replies
7
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
7
Views
2K
  • Engineering and Comp Sci Homework Help
Replies
1
Views
2K
  • Engineering and Comp Sci Homework Help
Replies
1
Views
3K
  • Engineering and Comp Sci Homework Help
Replies
1
Views
1K
Back
Top