This shows that my circuit does in fact still work effectively. I then also again had to test my circuit against my truth table, the results follow:Īgain, as you can see, the predicted columns of Q(x) and Q(y) match up with the corresponding columns (testing).
Step 6 -Test circuit against my truth table Step 5 – Build circuit on LivewireĪgain, I then made this circuit on LiveWire once more (got rid of redundant gates): This also used 7 NAND gates in total, and it also means that I only have to use one type of chip when it comes to manufacturing the circuit. The circuit below this is the final sketch for the Boxing Judge circuit.Īs you can see, this is far more simpler as compared to my first sketch. In the first image I have crossed out the gates that are made redundant. I could then further simplify my circuit.
#X NAND Y NAND X NAND Y SERIES#
Two NOT NAND equivalent gates in series cancel each other out (as they reverse each others function). This shows that my circuit does correspond to the initial truth table. I used the switches I input on LiveWire to control the the circuit and test it against my truth table which I have included below.Īs you can see, the predicted columns of Q(x) and Q(y) match up with the corresponding columns (testing). I then needed to test that my circuit still worked, as it did in my second entry. Step 3 – Test circuit against my truth table Below I have included the circuit diagram. I then used my sketch as a basis to design this circuit on LiveWire. Using the knowledge of what I have described above, I was able to change the circuit I designed in the last entry to its NAND equivalent, I will include the sketch below. Step 1 – Change gates to NAND equivalents I will now move on to discuss the process of changing my circuit from AND, NOT and OR gates to their NAND equivalents. Space is also an important issue concerned with small electrical applications – where space is crucial. This may not seem as important in this application, although in mass production it is important. NAND) and therefore it uses less space and less money. NAND equivalents are used so that you can use less chips (as all functions are done using the same gates i.e. This would result in the same output as shown in the XNOR gate truth table (see entry one) The XNOR equivalent in NAND gates in constructed by having the output of three NAND gates (which are connected as a NOR gate) and the output of a singular NAND gate feeding into a NAND gate. This is needed because if both inputs are high (A and B), then the inputs through to the final gate will be high, which results in the output being low (or 0/off). A NOR gate is the invert of an OR gate, therefore to achieve this using NAND equivalents, the output of the OR gate feeds into the NAND equivalent of a NOT gate which reverses the function.Ī XOR equivalent is similar to that of a NOR equivalent – although there is an additional NAND gate. This is easy to understand as it is based on the last gate (NAND equivalent of OR). The NAND equivalent therefore includes a NAND gate with inverted inputs (which are the NAND equivalent of the NOT gate i.e. An OR gate is the opposite of this, as if there are any inputs that are 1, then the gate will output a high signal. The truth table for a NAND gate shows that when any of the inputs are 0, the gate will output a 1 (on/high). As you can see, this gate is formed from a NAND gate followed by a NOT gate (above), therefore this reverses the command – and it is then a NOT NAND which results in an AND function. If you are trying to change an AND gate to its NAND equivalent, then it is simply two NAND gates that are directly connected together (see diagram below). A NAND gate is a NOT AND gate (see entry one), therefore by joining the two inputs, the gate functions as a NOT gate. A NOT gate can be made by connecting the two inputs of the NAND together (which makes sense as there is only one input in a NOT gate). Changing NOT TO NANDĪ not gate is the easiest to change into its NAND equivalent (see diagram). Below I will describe how all 7 logic gates can be changed to their NAND counterparts. Logic gates have NAND equivalents, and these are different ways of connecting NAND gates in order to produce the output which can be the same as an OR, NOT gate etc. In this entry, I will be looking at changing my circuit into its NAND equivalents, as this will make the circuit more simple (and I then only have to use one type of chip).
0 kommentar(er)
