"
Team:INSA Toulouse/contenu/project/binary reminder
From 2013.igem.org
Mesnageclem (Talk | contribs) |
|||
| Line 82: | Line 82: | ||
| - | <h1 class="title1"> | + | <h1 class="title1">Full adder Reminder</h1> |
<h2 class="title2">How to count with binary numbers?</h2> | <h2 class="title2">How to count with binary numbers?</h2> | ||
| Line 145: | Line 145: | ||
<br> | <br> | ||
| - | <p class="texteright450"><span class="spantitle">Full Adder</span></br> | + | <p class="texteright450"><span class="spantitle">Electronic Full Adder</span></br> |
<br>This is the truth table of a full adder.<p> | <br>This is the truth table of a full adder.<p> | ||
Revision as of 08:13, 27 September 2013
Full adder Reminder
How to count with binary numbers?
For those who don’t remember your binary counting courses (or for those who don’t have any idea about binary counting), we provide a little reminder!
| Operation | Result | ||
| Decimal | 5 | 2 | 7 |
| Binary | 1 (1*2^2) 0 (0*2^1) 1 (1*2^0) |
0 (0*2^2) 1 (1*2^1) 0 (0*2^0) |
1 (1*2^2) 1 (1*2^1) 1 (1*2^0) |
What is a logic gate?
A logic gate is an idealized or physical device implementing a Boolean function, that is, it performs a logical operation on one or more logical inputs, and produces a single logical output (From Wikipedia). Simply said: logic gates are the devices that perform the boolean logic operations.
AND Gate
For an AND gate, if the two inputs are equal to 1, the result equals 1.
OR Gate
For an OR gate, if one or the other (or both) of the inputs are equal to 1, the result equals 1.
XOR Gate
For a XOR gate, if one or the other (but not both of them) of the inputs are equal to 1, the result equals 1.
Electronic Full Adder
This is the truth table of a full adder.
