Team:INSA Toulouse/contenu/project/binary reminder

From 2013.igem.org

(Difference between revisions)
Line 113: Line 113:
   <h2 class="title2">What is a logic gate?</h2>
   <h2 class="title2">What is a logic gate?</h2>
<br>
<br>
-
 
+
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.
   <p class="texteleft"><span class="spantitle">AND Gate</span></br>
   <p class="texteleft"><span class="spantitle">AND Gate</span></br>
<br>For a AND gate, two inputs are needed to have a result egal 1.<p>
<br>For a AND gate, two inputs are needed to have a result egal 1.<p>

Revision as of 07:34, 27 September 2013

logo


Binary Reminder

How to count with binary numbers?

For those who don’t remember (or who don’t have any idea of) binary courses, a little reminder about binary counting is here for you!

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.

AND Gate

For a AND gate, two inputs are needed to have a result egal 1.


OR Gate

For a OR gate, one or the other (or both) of the inputs are needed to have a result egal 1.


XOR Gate

For a XOR gate, one or the other of the inputs are needed to have a result egal 1 but not both of them.


Full Adder

This is the truth table of a full adder.