Digital electronics

TSU Maintenance, facilities area

Teacher:
Luis Francisco Gonzales Garcia

Gael Jacob Gutierrez Contreras

Activity 1- unit 1
Types of logic gates and Boolean Algebra Theorems.

MI51
 Logic gates
Logic gates are electronic circuits internally made up of transistors that are found
with special arrangements with which they give voltage signals as a result or an
output in Boolean form, they are obtained by binary logic operations (addition,
multiplication).
There are different types of gates and some of these are more complex, with the
possibility of being simulated by simpler gates. All of them have truth tables that
explain the behavior of the results they give, depending on the Boolean value in each
of their inputs.

1. AND gate:
This gate is represented by a multiplication in Boolean Algebra. It indicates that all
its inputs must have a binary state of 1 for the output to give a binary 1. Otherwise,
if any of its inputs with this state is missing or does not have even one driven, the
output will not be able to change state and will remain at 0.

2. OR gate:
In Boolean Algebra this is an addition. This gate allows that with any of its inputs that
is in binary state 1, its output will go to state 1 as well. It is not necessary that all its
inputs are driven to achieve a state 1 at the output, but it does not cause any
inconvenience either. To achieve a 0 state at the output, all its inputs must be in the
same value of 0.
 3. NOT gate:
In this case this gate has only one input and one output and it acts as an inverter.
For this situation in the input will be placed a 1 and the output will give a 0 and in the
opposite case it will receive a 0 and will show a 1.

4. NAND gate:
Also known as negated AND, this gate works the opposite of an AND, since it has
no inputs in 1 or only some of them, it gives a 1 in its output, but if it has all its inputs
in 1, the output is presented with a 0.

5. NOR gate:
As we saw earlier, the OR gate also has its inverse version. This gate when it has
its inputs in state 0 its output will be in 1, but if any of its inputs goes to a state 1 no
matter in which position, its output will be a state 0.
 6. XOR gate:
Also called exclusive OR, this acts as a binary sum of one digit each and the result
of the sum would be the output. Another way of looking at it is that with equal input
values the output state is 0 and with different input values, the output will be 1.

7. XNOR gate:
This is the opposite of the XOR gate, since when the inputs are the same, the output
will be in state 1 and if they are different, the output will be in state 0.

[1]
 Boolean Algebra Theorems
A theorem is a mathematical proposition that can be proved from the postulates that
have been previously stated.
In Boolean Algebra we have the following theorems:

 Teorema 1:
 Teorema 2:
 Teorema 3:

 Teorema 4:

 Teorema 5:

 Teorema 6:

 Teorema 7:

 Teorema 8:

 Teorema 9:

 Teorema 10:
[2]
Referencias

[1] Logicbus, «Logicbus,» 2019. [En línea]. Available: https://www.logicbus.com.mx/compuertas-

logicas.php . [Último acceso: 12 mayo 2023].

[2] [En línea]. Available: https://angelmicelti.github.io/4ESO/EDI/index.html.