forked from sejo/compudanzas
digital systems
This commit is contained in:
parent
a752ed33f6
commit
439d92dd7d
|
@ -14,10 +14,34 @@ they show their possible inputs at their left, and their corresponding outputs t
|
|||
|
||||
=> ./img/foto_beans-computing_truth-tables.png photo of the NOT and NOR truth tables, composed of beans in a greenish surface
|
||||
|
||||
* NOT: the output is the opposite of the input. (table at the top left)
|
||||
## NOT
|
||||
|
||||
* NOR: the output is black only when none of the inputs are black. in any other case, the output is non-black. (table at the center) {nor}
|
||||
NOT: the output is the opposite of the input. (table at the top left)
|
||||
|
||||
+ <table>
|
||||
+ <tr><th>input</th><th>output</th></tr>
|
||||
+ <tr><td>0</td><td>1</td></tr>
|
||||
+ <tr><td>1</td><td>0</td></tr>
|
||||
+ </table>
|
||||
& * input: 0, output: 1
|
||||
& * input: 1, output: 0
|
||||
|
||||
## NOR
|
||||
|
||||
NOR: the output is black only when none of the inputs are black. in any other case, the output is non-black. (table at the center) {nor}
|
||||
|
||||
+ <table>
|
||||
+ <tr><th>inputs</th><th>output</th></tr>
|
||||
+ <tr><td>00</td><td>1</td></tr>
|
||||
+ <tr><td>01</td><td>0</td></tr>
|
||||
+ <tr><td>10</td><td>0</td></tr>
|
||||
+ <tr><td>11</td><td>0</td></tr>
|
||||
+ </table>
|
||||
& * inputs: 00, output: 1
|
||||
& * inputs: 01, output: 0
|
||||
& * inputs: 10, output: 0
|
||||
& * inputs: 11, output: 0
|
||||
|
||||
if you look closely you'll see that NOT can be defined the same way as NOR.
|
||||
|
||||
by combining multiple instances of these logic operations, we could build any possible digital behavior.
|
||||
by combining multiple instances of this logic operation, we could build any possible digital behavior.
|
||||
|
|
|
@ -1,12 +1,15 @@
|
|||
# compuertas lógicas
|
||||
|
||||
las bases de los circuitos digitales.
|
||||
las bases de los circuitos digitales, o {digital systems}
|
||||
|
||||
estos incluyen, claro está, a las {danzas compuertas}
|
||||
estos incluyen, claro está, a las:
|
||||
|
||||
=> ./danzas_compuertas.gmi {danzas compuertas}
|
||||
=> ./coloring_computers.gmi {coloring computers}
|
||||
=> ./beans_computing.gmi {beans computing}
|
||||
|
||||
usamos la convención de utilizar dos valores posibles: 1 para denominar arriba, o verdadero, y 0 para denominar abajo, o falso.
|
||||
|
||||
|
||||
# una entrada
|
||||
|
||||
## buffer
|
||||
|
@ -19,6 +22,14 @@ la salida es lo opuesto a la entrada.
|
|||
|
||||
también podríamos decir que la salida es lo que no es la entrada.
|
||||
|
||||
+ <table>
|
||||
+ <tr><th>input</th><th>output</th></tr>
|
||||
+ <tr><td>0</td><td>1</td></tr>
|
||||
+ <tr><td>1</td><td>0</td></tr>
|
||||
+ </table>
|
||||
& * input: 0, output: 1
|
||||
& * input: 1, output: 0
|
||||
|
||||
|
||||
# dos entradas
|
||||
|
||||
|
@ -55,6 +66,18 @@ que es lo mismo que decir que su salida es verdadera cuando todas sus entradas s
|
|||
|
||||
en cualquier otro caso, su salida es falsa.
|
||||
|
||||
+ <table>
|
||||
+ <tr><th>inputs</th><th>output</th></tr>
|
||||
+ <tr><td>00</td><td>1</td></tr>
|
||||
+ <tr><td>01</td><td>0</td></tr>
|
||||
+ <tr><td>10</td><td>0</td></tr>
|
||||
+ <tr><td>11</td><td>0</td></tr>
|
||||
+ </table>
|
||||
& * inputs: 00, output: 1
|
||||
& * inputs: 01, output: 0
|
||||
& * inputs: 10, output: 0
|
||||
& * inputs: 11, output: 0
|
||||
|
||||
NOR es una de las compuertas universales: con ella se puede construir a todas las demás.
|
||||
|
||||
esto se debe en parte a que NOR se convierte en NOT si sus dos entradas están conectadas como una sola.
|
||||
|
|
|
@ -0,0 +1,9 @@
|
|||
# digital systems
|
||||
|
||||
systems based on logic rules/gates ({compuertas}) and binary values.
|
||||
|
||||
see:
|
||||
|
||||
=> ./danzas_compuertas.gmi {danzas compuertas}
|
||||
=> ./coloring_computers.gmi {coloring computers}
|
||||
=> ./beans_computing.gmi {beans computing}
|
14
src/nor.gmo
14
src/nor.gmo
|
@ -2,8 +2,22 @@
|
|||
|
||||
una de las {compuertas} lógicas más recurrentes en los trabajos de compudanzas.
|
||||
|
||||
una de las compuertas universales: con ella podemos construir a cualquier otra.
|
||||
|
||||
# truth table
|
||||
|
||||
the output is 1 only when none of the inputs are 0.
|
||||
|
||||
in any other case, the output is 0.
|
||||
|
||||
+ <table>
|
||||
+ <tr><th>inputs</th><th>output</th></tr>
|
||||
+ <tr><td>00</td><td>1</td></tr>
|
||||
+ <tr><td>01</td><td>0</td></tr>
|
||||
+ <tr><td>10</td><td>0</td></tr>
|
||||
+ <tr><td>11</td><td>0</td></tr>
|
||||
+ </table>
|
||||
& * inputs: 00, output: 1
|
||||
& * inputs: 01, output: 0
|
||||
& * inputs: 10, output: 0
|
||||
& * inputs: 11, output: 0
|
||||
|
|
Loading…
Reference in New Issue