Tema 1 Introduccion 2020-2021

Escuela Politécnica Superior de Elche
Electrónica Digital
(3º Grado en Ingeniería Electrónica y Automática Industrial)
TEMA 1: Introducción a la electrónica

Digital
Javier Rubiato / Higinio Alavés / Jose A. Palazón

Electrónica Digital (Grado en Ingeniería Electrónica y Automática Industrial)
Unidad 1. Introducción a la electrónica Digital.

1.1 Conceptos básicos de electrónica digital
1.2 Simbología.
1.3 Álgebra de Boole.
1.4 Representación e implementación de un diseño digital.
1
1.1 Conceptos básicos de electrónica digital.
Las señales eléctricas, variaciones de tensión en un punto determinado del

circuito respecto a una referencia, son empleadas para transmitir información.
Estas señales pueden ser de dos tipos analógicas o digitales. En el primer
caso la variación de la señal es continua, mientras que el segundo se trata de
la discretización de dicha señal.
Proceso de digitalización: 1º Muestreo, 2º Cuantificación y 3º Codificación
2
Ventajas
• Los sistemas digitales son generalmente faciles de diseñar

• Permitir a los sistemas digitales (µP, CPUs, etc) trabajos con señales
analógicas del mundo real.
• La información se puede procesar, almacenar y transmitir de forma más
sencilla.
• Los efectos del ruido afectan de menor forma. Los efectos de ruido,
humedad o temperatura no afectan a estas señales codificadas por lo
que su precisión y exactitud son fáciles de mantener con el tiempo
Desventajas
• Pérdida de calidad/resolución (Error de cuantificación entre otros).

• Disminución de la eficiencia (mayor frecuencia de trabajo generalmente,
mayor consumo, o tamaño…).
3
eter), acceleration (airbag collision detection), pressure (oil, manifold), and
flow rate (fuel), to name just a few. Chapter
Electrónica Digital (Grado en Ingeniería Electrónica y 11 will cover the devices that
Automática Industrial)
convert analog to digital.
To illustrate a typical system that uses this approach Figure 1-12
describes a precision temperature regulation system. A user pushes up
or down buttons to set the desired temperature in 0.1° increments (digi-
Ejemplo tal representation). A temperature sensor in the heated space converts the
measured temperature to a proportional voltage. This analog voltage is
Sistema de regulación de temperatura de precisión
Digital input:
Digital signal representing
Set desired temperature
power (voltage) to heater
+ Temperature-controlled
Digital–analog space
Digital processor
conversion
– Sensor
Heat
Analog–digital
conversion
Digital signal representing Analog signal representing
actual temperature actual temperature
FIGURE 1-12 Diagram of a precision digital temperature control system.
4
Just as you realize that the night does not change instantly int
that no digital signal can truly change instantly from LOW to
is a time of transition. It is common to declare the transiti
ing when the signal is half way between the two states. Mea
taken from the 50% point of waveform. For example, the wid
pulse is measured as shown in Figure 1-10. The period T is
1.1.1 Señales Digitales from 50% points as shown. Chapter 5 will have more to say a
ments of these transition times and the period of a digital wa
• Periódica y Aperiódica FIGURE 1-10 Measuring

High
(T)
pulse width and period.
• Periodo (T=1/F) y Frecuencia (F=1/ T)
• Ciclo de trabajo (DC = tw/T) t w
Low
• Niveles y flancos/transiciones
• Impulso ideal SI tiene cambios de nivel instantáneos pero el real NO
Edges/Events
Impulso IDEAL Impulso REAL
Whenever you have a system with only two states, the only th
considered an “event” is when the system changes states. A t
LOW to HIGH or HIGH to LOW is considered an “event” in d
On timing diagrams, these transitions appear as sharp “edges
are rising edges and some are falling edges. We will learn
that there are circuits that respond to HIGH levels (activ
circuits that respond to LOW levels (active LOW). Circuits
to a particular level are often considered to be level triggere
of digital circuits respond to either rising edges or falling
are called edge triggered circuits. Chapter 5 will introduce e
devices.
tw: Anchura de pulso. Tiempo transcurrido entre el
50% del flanco de subida y el 50% del de bajada.
tr y tf: tiempos de subida y bajada. Generalmente el

tiempo transcurrido entre el 90% y 10% del flanco.
5
La electrónica digital trabaja, en la mayor parte de los casos, con

sistemas y circuitos con dos estados posibles representados por dos
niveles de tensión diferentes.
• Código: Combinación de estos dos estados, que permite expresar

cualquier número, letra, símbolo, etc.
• Bit: Dígito binario cuyo valor puede ser “0” o “1”. Se representa con
la letra “b” minúscula.
• Byte: Conjunto de 8 bits. Se representa en este caso con “B”
mayúscula.
• Palabra (Word): Conjunto de varios bits que forman un múltiplo de
la unidad de información en un sistema digital.
6
Niveles lógicos: son los valores de tensión que se utilizan para

representar los “1” y “0”. Tanto para representar un nivel alto como
bajo, se utilizan franjas de tensión entre un máximo y un mínimo.
7
El periodo de bit es el intervalo de tiempo definido que ocupa un
bit dentro de una secuencia.
Sistema asíncrono
(UART)
Sistema síncrono
(SPI)
8
Cronograma o diagrama de tiempo: relación temporal de varias señales.
9
being employed.
her hand, it is very easy to design simple, accurate electronicand take that
circuits each symbol (digit) in progression until we reach 9. Then we add
In the binary system, the term binary digit is often abbreviated to the
perate with only two voltage levels. For this reason, almost aevery 1 to the next higher position and start over with 0 in the first position
digital term bit, which we will use from now on. Thus, in the number expressed
ystem uses the binary (base-2) number system as the basic number (see Figure
system1-14). This process continues until the count of 99 is reached.
in Figure 1-15 there are four bits to the left of the binary point, represent-
Then
its operations. Other number systems are often used to interpret or repre- ing the we add a 1 to the third position and start over with 0s in the first two
integer part of the number, and three bits to the right of the binary
positions.
ent binary quantities for the convenience of the people who work with and point, representing The same pattern is followed continuously as high as we wish
the fractional part. The most significant bit (MSB) is the
se these digital systems. to count.
leftmost bit (largest weight). The least significant bit (LSB) is the rightmost
In the binary system there are only two symbols or possible digit values, bit (smallest weight). These are indicated in Figure 1-15. Here, the MSB
CHAPTER
and 1. Even 1.1.2 Sistemas Numéricos
1/INTRODUCTORY
so, this base-2CONCEPTS
system can be used to represent any quantity has a weight of 23; the LSB has a weight of 2-3. The weights of each digit
FIGURE 1-14 Decimal
hat can be represented in decimal or other number systems. In general increase by01 a factor of 2 as the20 103
21position moves from right to left.
counting.
hough, it will take a greater number of binary digits to express a given 2 22
uantity.
FIGURE 1-13 Decimal Positional values 3 23
All ofvalues
position the statements
as powers made earlier concerning the decimal system Binary Counting
(weights) 4
5
24
25
re
of equally
10. applicable to the binary system. The binary system is also a When we deal 6 with binary numbers,
26 we will usually be restricted to a spe-
ositional-value system, wherein each 10 3 10 2 10 1 10 0 1021 1022 1023
binary digit has its own value or cific number 7 of bits. This restriction
27 is based on the circuitry used to repre-
eight expressed as a power of 2. This is illustrated in Figure 1-15. Here, sent these 89binary numbers. Let’s 28
29 use four-bit binary numbers to illustrate
aces to the left of the binary point (counterpart of the decimal point) are the method 10 for counting in binary.
30
2 7 4
ositive powers of 2 and places to the right are5negative
2 1 4
powers of 2. The 11
The sequence (shown in Figure 1-16) begins with all bits at 0; this is
umber 1011.101 is shown represented in the figure. To find its equivalent called the12 zero count. For each successive count,200
13
199
the units (20) position tog-
the decimal system, we simply take the sum of the
Decimal
products of each digit gles; that is,
14 it changes from one binary value to the other. Each time the
MSD LSD
alue (0 or 1) and its positional value: point 15
units bit changes from a 1 to a 0, the twos (21) position will toggle (change
16 99
states). Each
17 time the twos position
100 changes from 1 to 0, the fours (22) posi-
3 2 1 0
1011.1012 = 11 * 2 2 + 10 * 2 2 + 11 * 2 2 + 11 * 2 2 tion will toggle
18 (change states).101 Likewise, each time999 the fours position goes
-1 -2 -3 from 1 to 19
0, the eights (23 102
) position toggles. 1000 same process would be
This
+ 11 * 2 2 + 10 * 2 2 + 11 * 2 2
Figure 1-13, where the number 2745.214 is represented. The decimal point
separates the 8 + 0 + powers
= positive 2 + 1 +of0.5 10+from
0 + the
0.125negative powers. The number continued for the higher order bit positions if the binary number had more
2745.214 is thus equal to than four bits.
= 11.625 10 It is important to note that in decimal counting, the units position (LSD)
12 * 10 + 32 + 17 * 10 + 22 + 14 * 1012 + 15 * 10 FIGURE
0
2 1-16 changes
Binary upward with each
Weights
step in the count, the tens
23 5 8 22 5 4 215 2 20 5 1
position
Decimal changes
equivalent
counting sequence.
-1 -2upward every -3 10 steps in the count, the hundreds position changes upward
IGURE 1-15 Binary Positional + 12 * 10 2 + 11 * 10 2 + 14 * 10 2 0 0 0 0 0
every 100 steps in the count, 0 and 0so on.
0 1 1
osition values as powers values
0 0 1 0 2
In
2. general, any number is simply the sum of the products
1 1 1 of each digit value
0 1 1 3
8 4 2 1 0
and its positional value. 2 4 8
0 1 0 0 4
23 22 21 20 221 222 223 0 1 0 1 5
0 1 1 0 6
Decimal Counting 0 1 1 1 7
1 0 we
1 start
1 1 0 0 in
1 the units position 1 0 0 0 8
When counting in the decimal system, with 9
1 0 0 1
and take each symbol (digit) in progression until we reach 9. Then we add 1 0 1 0 10
a 1 to the next higher position and start over with 0 in the first position 1 0 1 1 11
MSB Binary LSB
(see Figure 1-14). This process continues until
pointthe count of 99 is reached. 1 1 0 0 12
Then we add a 1 to the third position and start over with 0s in the first two 1 1 0 1 13
1 1 1 0 14
positions. The same pattern is followed continuously as high as we wish
1 1 1 1 15
to count.
ero is counted as a number.
10
LSB
FIGURE 1-14 Decimal 0 20 103
-2 DECIMAL-TO-BINARY
UTCOMES
dentify the weight of each bit in a CONVERSIONSbinary number.
equivalent simply by summing together the weights of the various positions
in the binary number that contain a 1. To illustrate, let’s change 11011 YES 2
to
pon completion
xplained Electrónica Digital (Grado en Ingeniería Electrónica y
in Chapter of this section,
1, the binaryyou number will system
be able
itsisto:
a positional
decimal system
equivalent. Automática Industrial)
END
eUTCOMES
each binary digit (bit) carries a certain weight based on its position Collect R’s into desired
Convert decimal numbers to binary. 1 1 0 1 12 binary number with
ve to the LSB. Any binary number
pon completion of this section, you will be able to: can be converted to its decimal
CALCULATOR4 3 HINT: 1 0
first R as LSB and
Identify the number of bits needed for aofgiven range positions 2 +

of values. 2 + 0 + 2 + 2 = 16 + 8 + 2 + 1 last R as MSB
valent simply by summing together
Convert decimal numbers to binary. the weights the various
= 2710the divisions by 2, you can tell wh
e binary
Identify Conversión Binario-Decimal
number that contain
the range of values a 1. given
To illustrate,
the numberlet’s change
of bits. If11011
you use 2 to
a calculator to perform
Identify
cimal the number of bits needed for a given
equivalent. Let’s tryrange of
anotherthevalues.
remainder
example with is 0 or 1 by whether
a greater number or notof the
bits:result has a fractional par
25 END
here are two
Identify the ways
1 range 1
to
of convert
0 values
1
a decimal
1given the number bits.instance,
wholeofnumber 1 to its
would produce 12.5. Since there is a fractional part (the .5
0 2 equivalent
1 1 0 1 0 12 =
nary-system4 representation.
2
The first method is theremainder reverse
7
is a5the
of 1. Iffirst
4
there were 2
no fractional
0
part, such as 12 2 = 6, the
here are two 2 ways 3
+ 2 +to0 convert 1
+ 2 + 2a = 0
16 + 8 whole
decimal + 2 + 1numberremainder to2 its + 0equivalent
+would
2 + be 2 0. 0 + 2 CALCULATOR
+ Example + 2-1 2 = HINT:
0 +illustrates181this.
10
rocess described in Section 2-1. =The 2710decimal number is simply expressed
inary-system representation. The first method
Noteisthatthethe reverse
procedure of theis tofirst
find the weights If you (i.e.,
use a powers
calculatorof to 2) for each
perform bit
the divisions b
s a sum of powers of 2, and then 1s and 0s are written in the appropriate bit the remainder is 0 or 1 by whether or not the resul
rocess described
try another example in Section 2-1. The
with a greater decimal
number of position
number
bits: that is contains a 1, and then to add them up.
simply expressed instance, 25
Also note that the MSB
ositions. To illustrate: 7 2 would produce 12.5. Since there is a fr
1Conversión Decimal-Binario
s a sum of powers has a weight of 2appropriate
even thoughbit it is the eighth bit; is
this
a 1.is
If because
there werethe LSB is part
0 of12, and 1 then 0 1s 1 and 00s are
EXAMPLE =written in the
122-1 Convert 37 10 to binary. 0 Try to remainder
do it on your own before you no fractional
look at the sol
ositions. To45 7illustrate:
= 325 + 8 4 + 4 + 12 = 2 5
+ 00the+ first
2 3 bit2and has a 0weight of 2 .
+ 2 + 0 + 2 remainder would be 0. Example 2-1 illustrates this
2 +100 + 2 + 2 + 0 + 2 + 0 + 2 = 181 Another method
0 20 1of binary-to-decimal conversion that avoids the addi-
10 Solution
= 51 0 31 21
45
that the procedure
10 = 32 + 8 + 4 + 1 = 2 +
is to find the weights (i.e., powers 0 + 2 +
tion of of 2 +
2) for
large 0 + 2
each bitand keeping
numbers 37 track of column weights is called the
ion 1 = 1 4 0 1 1 0 1 EXAMPLE 2-1 18. 5Convert remainder of 1 (LSB)
ote that
thatcontains a 1, and
a 0 is placed inthen
the to 2 addandthem up.double-dabble
2 positions, Also note
since that the
allmethod.2MSBThemust
positions procedure
2 be is as follows:
3710 to binary. Try to do it on your own befo
weight of 27 even
ccounted though it is the eighth4 bit; this is because the LSB is
ote that afor.
0 is Another
placed inexample
the 21 and is 2the following:
positions, since down
1. Write all positions must1be
the left-most in Solution
18the binary number.
rst bit and has a weight of 20. 9.0 37 0
ccounted for. 7610 Another 64 +example
8 + 4 =is 2the
= binary-to-decimal 6 following:
+ 0 + 0 2.+that 23 avoids
+ 22it +and
Double 0 add 0 the next bit
+addi- 2 to the right. 18. 5 remainder of 1
nother method of conversion the 2
of large numbers
7610 = and 64 +keeping
8 + 4 = =261 +of0column
track 3Write
1+ 221
0+ 0 0+3.2weights down +0the
is 0called
+ 0 result
0
the
2 under 9the next bit. 18
le-dabble method. The procedure is as follows: 4.5 19.0 0
= 1 0 0 4.1 Continue1 0with0steps
2 2 and 3 until
2 finished with the binary 2 number.
Another method for converting decimal integers uses repeated division
Write down
y 2.Another
The the left-most
method
conversion, for 1converting
in the binary
illustrated number.
decimal
below Let’s
integers
for 25 useuses
the same binary
repeated numbers
division 4 to verify this method.
9
10, requires repeatedly dividing
2.0 2 0
4.5 1
youble it and
e2.decimal
The add the by
conversion,
number next bit towriting
illustrated
2 and the right.
below for 25the
down 10,Given:
requires
remainderrepeatedly
after
1 dividing
each
1 02
division 1 12
4
he
ntildecimal
Write adown number
the
quotient of 0by
result is2obtained.
underand writing
the down
nextNote
bit. thethe
that remainder after1 each
binary result
Results: is 2division2by
2 =obtained 2
2.0 0
ntil a quotient
riting
ontinue the first
with of 02 is obtained.
remainder
steps and Note
as finished
3 until the LSB that the
and
with the
the binary result is obtained
last remainder
binary number. as1 the by
MSB. 1.0 0
2 2
riting
his the first remainder in as the
the flowchart
LSB and the last remainder as the MSB. to 1.0 0
useprocess,
the samediagrammed
binary numbers to of Figure
verify this method. 2-1, can also 3be 2used
= 61 2
his process,
onvert diagrammed
from1decimal in
to any the flowchart
other1number of Figure 2-1, can also
system, as we shall see. be used to
0 0.5 1 (MSB)
en: 1 0 1 1
onvert from decimal to any other number system, as we shall see.
2 2 0.5 1
6 2 = 12 2
sults: 1 2 =252 10
LSB Thus, 37 = 1001012. 1 Thus, 3710 =
2}5} 5 12 1 remainder of 1 LSB 1001012.
}}215 12 1 remainder of 1 13 2 = 26
23 2= 6 1 11
12 0 2710
12
} 561 remainder of 0
QUESTIONS
2/NUMBER SYSTEMS AND CODES
9F216 =Electrónica Digital (Grado en Ingeniería Electrónica y
9 F 2 Automática Industrial)
CHAPTER 2/NUMBER STYSTEMS AND CODES T T 2-6 PUTTING IT ALL TOGETHER
= 1 0 0 1 1 1 1 1 0 0 1 0
Table 2-4 gives the representation of the decimal numbers 1 thro
umber to =binary. Each hex2digit is converted to its four-bit binary
100111110010
CHAPTER
ent Conversión Hexadecimal-Binario
NUMBER to
2-1).SThis
hex2/number
a (Table YSTEMS AND CODES
binary. Each hex digit
is illustrated belowis converted
binary and hex number systems and also in the BCD and Gray cod
for 9F216to. its four-bit binary
it carefully and make sure you understand how it was obtaine
equivalent (Table 2-1). This is illustrated below for 9F216. note how the BCD representation always uses four bits for each d
ractice, verify that BA616 = 1011101001102.
9F216 = 9 F 2
a hex number to9F2 16 =
binary. 9 F its 2
T EachT hex digit Tis converted
T
TABLE to2-4 four-bit binary
TNumber
T Decimal Binary Hexadecimal BCD G
equivalent (Table 2-1). This is illustrated below for 9F216. equivalents.
system/code
to-Hex Conversion
= 1 0= 10 01 0 11 11 11 11 1 0 0 0 0 11 00 0 0 0 0000 0
= 16100111110010
9F2 = = 100111110010
9 2 2 F 2 1 1 1 0001 0
on from binary to hex
T
is just the
T
reverse of
T
the process above.
2 10 2 0010 0
ry number
For is
practice, verify grouped
practice,
= verify
1
that
Ejemplo: 0BA6 into
that
0 1BA6
= groups
1 =1 1
101110100110
16 of1 four
101110100110 0 . bits,
20. 1 and
0 each group 3
is 11 3 0011 0
16 2
d to its equivalent hex digit.
= 100111110010 2 Zeros (shown shaded) are added, as 4 100 4 0100 0
o complete a four-bit
Binary-to-Hex group.
Conversion 5 101 5 0101 0
y-to-Hex
ConversionConversion
For practice, verify that BA616 = 1011101001102.
from binary to hex is just the reverse of the process above. 6 110 6 0110 0
sionThefrom
1 1 binary
1binary 1 0 0 to
0 number 1is1hex
02 is just
grouped 0 the
0into 1 reverse
1groups 0 of
1 0of 1four 0 the 1 process
1 and
bits, above.
0each group is 7 111 7 0111 0
Binary-to-Hex
nary numberto isitsConversion
converted equivalent
grouped hex groups
into digit. Zeros (shown
of four shaded)
bits, are added,
and each groupasis8 1000 8 1000 1
needed,
Conversion to complete
ed to its equivalent a
from binary hexfour-bit
to hex 3 the reverse
group.
is just
digit. Zeros A ofshaded)
(shown the6process
are above.
added, as9 1001 9 1001 1
The binary number is grouped into groups of four bits, and each group is
Conversión Decimal-Binario
, to complete a1four-bit
110100
onverted to its equivalent
group.3A6 0 0 1 1 1 0 1 0 0 1 1 0
02 16
1 1digit.
hex Zeros (shown shaded) are added, as
10 1010 A 0001 0000 1
11 1011 B 0001 0001 1
needed, to complete a four-bit group. 3 A 6
erform1these1 1 0 1conversions
0 0 1 1 02 between
0 0 1 1 1hex 0 1 and
0 0 binary,
1 1 0 it is necessary 12 1100 C 0001 0010 1
3A616
he four-bit1binary
1 1 0 1 0 numbers
0 1 1 02 0(0000
0 1 1 through
1 0 1 0 0 1 1111)
1 0 and their equiva- 13 1101 D 0001 0011 1
3 A 6
digits.ToOnce these
perform are
these mastered,
conversions 3 the conversions
between hex and 6binary,
A can benecessary
it is performed14 1110 E 0001 0100 1
to know theneed
four-bit 3A6 16
without the forbinary numbers
3A616(0000 through
any calculations. This is1111)
why and
hextheiris soequiva-
useful 15 in 1111 F 0001 0101 1
lent hex digits. Once these are mastered, the conversions can be performed
ting large
perform
quickly binary
these
without
To perform thenumbers.
conversions
these
between
need for any
conversions
hex
calculations.
between
and binary,
Thisbinary,
hex and is why it
hex it necessary
is is
issonecessary
useful in
wractice,
othe verify
four-bit
representing
know the that
Ejemplo:
binary
large
four-bit 101011111
numbers
binary
binary (0000
numbers.
numbers (0000 15F
2 = through16. 1111)
through 1111)andandtheirtheir equiva-
equiva-
xent
digits.
For
hex Once
digits. these
practice,
Once arethat
verify
these mastered,
are 101011111
mastered, the
2 =conversions
the 15F16.
conversions can
can be be performed
performed
without
quickly the need
without for for
the need anyany
calculations. Thisisiswhy
calculations. This why hex
hex isuseful
is so so useful
in in
ng inlarge
nting Hexadecimal
epresenting
Counting large
in binary
binary numbers.
numbers.
Hexadecimal
12
For practice, verify that 1010111112 = 15F16.
practice,
unting
Whenin verify
hex,
counting inthat
eachhex, 101011111
digit
each position 2 =can
digit position15Fbe16
can . incremented (increased
incremented
be (increasedby 1)by 1)
1.2 Simbología.
Puertas lógicas:
13
Flip-Flops:
14
Circuitos digitales:
15
1.3 Álgebra de Boole.
La electrónica digital se basa en la lógica binaria y emplearemos para

operar una estructura algebraica denominada álgebrá de Boole, en
honor a George Boole (matemático inglés).
El álgebra de Boole define una serie de normas que nos permitirá
operar con sistemas algebraicos binarios.
16
1.4 Representación e implementación de un diseño digital.
17
18
19
20

Tema 1 Introduccion 2020-2021

Cargado por

Información del documento

Descripción original:

Derechos de autor

Formatos disponibles

Compartir este documento

Compartir o incrustar documentos

Opciones para compartir

¿Le pareció útil este documento?

¿Este contenido es inapropiado?

Copyright:

Formatos disponibles

Tema 1 Introduccion 2020-2021

Cargado por

Copyright:

Formatos disponibles

Escuela Politécnica Superior de Elche

TEMA 1: Introducción a la electrónica

Javier Rubiato / Higinio Alavés / Jose A. Palazón

Unidad 1. Introducción a la electrónica Digital.

1.1 Conceptos básicos de electrónica digital.

Las señales eléctricas, variaciones de tensión en un punto determinado del

Proceso de digitalización: 1º Muestreo, 2º Cuantificación y 3º Codificación

• Los sistemas digitales son generalmente faciles de diseñar

• Pérdida de calidad/resolución (Error de cuantificación entre otros).

FIGURE 1-12 Diagram of a precision digital temperature control system.

• Periódica y Aperiódica FIGURE 1-10 Measuring

tr y tf: tiempos de subida y bajada. Generalmente el

La electrónica digital trabaja, en la mayor parte de los casos, con

• Código: Combinación de estos dos estados, que permite expresar

Niveles lógicos: son los valores de tensión que se utilizan para

Cronograma o diagrama de tiempo: relación temporal de varias señales.

Identify the number of bits needed for aofgiven range positions 2 +

1.3 Álgebra de Boole.

La electrónica digital se basa en la lógica binaria y emplearemos para

1.4 Representación e implementación de un diseño digital.

También podría gustarte