mNo edit summary |
mNo edit summary |
||
| Line 1: | Line 1: | ||
== Introduction == | === Introduction === | ||
This small guide is for players who are completely new to binary logic. It shows how the names of the gates correspond to words in a sentence and how they can be used to create circuits by simply describing what you see in a truth table. | This small guide is for players who are completely new to binary logic. It shows how the names of the gates correspond to words in a sentence and how they can be used to create circuits by simply describing what you see in a truth table. | ||
This concept might be perceived as obvious for people with background knowledge, but is still something that each of us had to learn at some point. | This concept might be perceived as obvious for people with background knowledge, but is still something that each of us had to learn at some point. | ||
== Step 1: Describe the green outputs == | === Step 1: Describe the green outputs === | ||
Let's take a look at the XOR level and its truth table | Let's take a look at the XOR level and its truth table | ||
[previewimg=31167771;sizeOriginal;xor.png][/previewimg] | [previewimg=31167771;sizeOriginal;xor.png][/previewimg] | ||
'''We want to describe each combination, that turns the desired output''' {{On}} | |||
What's the idea? If we make sure that our circuit outputs {{On}} in all relevant cases, then it automatically outputs {{Off}} in all other cases. So we only have to focus on the {{On}} and get the {{Off}}s for free. | What's the idea? If we make sure that our circuit outputs {{On}} in all relevant cases, then it automatically outputs {{Off}} in all other cases. So we only have to focus on the {{On}} and get the {{Off}}s for free. | ||
| Line 33: | Line 33: | ||
We now have a complete description when our circuit outputs {{On}} | We now have a complete description when our circuit outputs {{On}} | ||
== Step 2: Replace 'Red' with 'Not Green' == | === Step 2: Replace 'Red' with 'Not Green' === | ||
We only focus on {{On}} signals, that's why we try to avoid using the {{Off}} symbol in our description. | We only focus on {{On}} signals, that's why we try to avoid using the {{Off}} symbol in our description. | ||
Here is the trick: When something is {{Off}}, we can also say it is | Here is the trick: When something is {{Off}}, we can also say it is '''<nowiki>'</nowiki>not {{On}}<nowiki>'</nowiki>'''. | ||
So let's replace every {{Off}} symbol: | So let's replace every {{Off}} symbol: | ||
| Line 42: | Line 42: | ||
[previewimg=31168354;sizeOriginal;desc4.png][/previewimg] | [previewimg=31168354;sizeOriginal;desc4.png][/previewimg] | ||
== Step 3: Highlight the gate names == | === Step 3: Highlight the gate names === | ||
The connecting words in our sentence are also the name of gates! | The connecting words in our sentence are also the name of gates! | ||
| Line 49: | Line 49: | ||
[previewimg=31168895;sizeOriginal;desc5.png][/previewimg] | [previewimg=31168895;sizeOriginal;desc5.png][/previewimg] | ||
''Notice, that i also added some brackets, since AND is a stronger connection than OR.'' | |||
== Step 4: Build the circuit == | === Step 4: Build the circuit === | ||
Now we can build a circuit that exactly matches our description, using the same gates that we highlighted in our sentence: | Now we can build a circuit that exactly matches our description, using the same gates that we highlighted in our sentence: | ||
| Line 58: | Line 58: | ||
This technique works for every truth table. | This technique works for every truth table. | ||
---- | |||
The structure of the resulting circuit is called | The structure of the resulting circuit is called ''Canonical Disjunctive Normal Form (CDNF)'' which can usually be optimized to require fewer gates (there are several techniques to achieve this). | ||
== More phrases == | === More phrases === | ||
By using phrases that contain only AND, OR, and NOT, you can build any circuit you want, by simply describing each combination for each {{On}} output. But there is more... | By using phrases that contain only AND, OR, and NOT, you can build any circuit you want, by simply describing each combination for each {{On}} output. But there is more... | ||
You can use the following phrases and translate them into gates: | You can use the following phrases and translate them into gates: | ||
=== NOR gate === | ==== NOR gate ==== | ||
[previewimg=31675797;sizeOriginal;NOR_circ.png][/previewimg] | [previewimg=31675797;sizeOriginal;NOR_circ.png][/previewimg] | ||
=== XOR gate === | ==== XOR gate ==== | ||
Phrases like | Phrases like ''"...different values"'' or ''"...not the same"'' translate into an '''XOR''' gate | ||
[previewimg=31675802;sizeOriginal;XOR_circ.png][/previewimg] | [previewimg=31675802;sizeOriginal;XOR_circ.png][/previewimg] | ||
=== XNOR gate === | ==== XNOR gate ==== | ||
Phrases like | Phrases like ''"...equal values"'' or ''"...the same"'' translate into an '''XNOR''' gate | ||
[previewimg=31675808;sizeOriginal;XNOR_circ.png][/previewimg] | [previewimg=31675808;sizeOriginal;XNOR_circ.png][/previewimg] | ||
=== Conditions === | ==== Conditions ==== | ||
Phrases like | Phrases like ''"...under the condition that..."'' or ''"If...then"'' translate into an '''AND''' gate or a '''SWITCH''' | ||
[previewimg=31675984;sizeOriginal;COND_circ.png][/previewimg] | [previewimg=31675984;sizeOriginal;COND_circ.png][/previewimg] | ||
Revision as of 15:03, 28 October 2023
Introduction
This small guide is for players who are completely new to binary logic. It shows how the names of the gates correspond to words in a sentence and how they can be used to create circuits by simply describing what you see in a truth table.
This concept might be perceived as obvious for people with background knowledge, but is still something that each of us had to learn at some point.
Step 1: Describe the green outputs
Let's take a look at the XOR level and its truth table
[previewimg=31167771;sizeOriginal;xor.png][/previewimg]
We want to describe each combination, that turns the desired output 
What's the idea? If we make sure that our circuit outputs in all relevant cases, then it automatically outputs 
in all other cases. So we only have to focus on the and get the s for free.
Start like this:
[previewimg=31168005;sizeOriginal;desc1.png][/previewimg]
There are 2 columns, that turn the desired output to .
Let's start with the first and expand our descriptive sentence.
[previewicon=31168099;sizeOriginal;xor1.png][/previewicon]
[previewimg=31168159;sizeOriginal;desc2.png][/previewimg]
Nice! Okay that's the first column - now let's add the second.
[previewicon=31168184;sizeOriginal;xor2.png][/previewicon]
[previewimg=31168205;sizeOriginal;desc3.png][/previewimg]
We now have a complete description when our circuit outputs
Step 2: Replace 'Red' with 'Not Green'
We only focus on signals, that's why we try to avoid using the symbol in our description.
Here is the trick: When something is , we can also say it is 'not '.
So let's replace every symbol:
[previewimg=31168354;sizeOriginal;desc4.png][/previewimg]
Step 3: Highlight the gate names
The connecting words in our sentence are also the name of gates!
Let's highlight all words, that are also names of gates and see what it looks like:
[previewimg=31168895;sizeOriginal;desc5.png][/previewimg]
Notice, that i also added some brackets, since AND is a stronger connection than OR.
Step 4: Build the circuit
Now we can build a circuit that exactly matches our description, using the same gates that we highlighted in our sentence:
[previewimg=31169306;sizeOriginal;circuit.png][/previewimg]
This technique works for every truth table.
The structure of the resulting circuit is called Canonical Disjunctive Normal Form (CDNF) which can usually be optimized to require fewer gates (there are several techniques to achieve this).
More phrases
By using phrases that contain only AND, OR, and NOT, you can build any circuit you want, by simply describing each combination for each output. But there is more...
You can use the following phrases and translate them into gates:
NOR gate
[previewimg=31675797;sizeOriginal;NOR_circ.png][/previewimg]
XOR gate
Phrases like "...different values" or "...not the same" translate into an XOR gate
[previewimg=31675802;sizeOriginal;XOR_circ.png][/previewimg]
XNOR gate
Phrases like "...equal values" or "...the same" translate into an XNOR gate
[previewimg=31675808;sizeOriginal;XNOR_circ.png][/previewimg]
Conditions
Phrases like "...under the condition that..." or "If...then" translate into an AND gate or a SWITCH
[previewimg=31675984;sizeOriginal;COND_circ.png][/previewimg]