Send the link below via email or IMCopy
Present to your audienceStart remote presentation
- Invited audience members will follow you as you navigate and present
- People invited to a presentation do not need a Prezi account
- This link expires 10 minutes after you close the presentation
- A maximum of 30 users can follow your presentation
- Learn more about this feature in our knowledge base article
Do you really want to delete this prezi?
Neither you, nor the coeditors you shared it with will be able to recover it again.
Make your likes visible on Facebook?
You can change this under Settings & Account at any time.
Josh Wilkinson 30 May 2013
Transcript of Discovering Digital
X+Y+Z Maxterms An input is either a 0 or a 1, and these inputs are labeled X,Y, and Z. However, when an input is 0, it is representing its opposite, so we call it not X, shown as X _ To represent the unsimplified version of the output with algebra, we take the sum of the minterms or the product of the maxterms Both the POS and the SOP represent the output in the form of an unsimplified Boolean expression. XYZ+XYZ+XYZ+XYZ=O (X+Y+Z)(X+Y+Z)(X+Y+Z)(X+Y+Z)=O To fully reduce these expressions, one can opt to either Boolean algebra or karnaugh mapping (K-mapping) Lets stick with minterms from now on In order to K-map, we use a chart like this: You can only switch one not at a time! Its also traditional to start with all nots in upper left Now we plug in the minterms into the chart - remember minterms represent 1s. XYZ+XYZ+XYZ+XYZ=O 1 Now what do you do with this? Well, you take and group the 1s into the largest groups possible. However, only groups of 1, 2, 4, 8, etc work. You also want to make sure that you have the fewest groups possible. It is also OK to overlap your groups. Here is what this one looks like. The object is to circle all the ones in the fewest, but biggest groups. Additional Rules You can also have a group of 4, by grouping the corners. You can group 1s across the chart as well. Additional Rules Now that we have a truth table and our simplified Boolean expression, we can now create our circuit. Their are many different ways to make our circuit. AOI stands for the three types of gates it contains; The And gate, the Or gate, and the Inverter gate. These expressions that we obtain represents our output. When two inputs are next to each other (AB) it shows us A and B. A+B represents A or B just as X represents not X. Expressions The and gate The and gate represents two inputs that are paired such as AB. When these two inputs are anded, they only output a one when both A AND B are 1s. The or gate An or gate represent the Boolean expression of the sum of two inputs (A+B). An or gate outputs a 1 when either input is a 1 or when both inputs are 1s. The inverter (not) gate The not gate represents the opposite of an input; it represents not X (X). Nor only logic Nor only logic means that only nor gates are used to make the circuit. A nor gate represents a not or gate. So every output made by an or gate is inverted. Nand only logic Nand only logic means that only nand gates are used to make the circuit. A nand gate is simply a not and gate. So every output from an and gate is inverted. Breadboarding is another process used to simulate a circuit. Like multisim, a breadboard uses logic gates and wires to create a circuit. These columns are for power and ground Each row is connected but not to each other Once finished creating the simulated circuit in either multisim or on a breadboard, you must test it to see if it works. You would go through and test every possibility and compare the results to your truth table. Testing If the truth tables match, you have successfully created your circuit... However, if your truth table is misrepresented, then you messed up somewhere :( This is where troubleshooting comes in Now to simulate our circuit Once circled, we look at one group (orange) and see that we have XYZ and XYZ so the Y and Y cross out and become XZ. The other group, the X and X cross out becoming YZ. Then you add your new terms to get XZ+YZ as our simplified Boolean expression Here is our simplified Boolean expression - XZ+YZ. Now we have to create a simulation and one possible way to do this is on a program called multisim First we would add our power and ground as well as our inputs X Y Z Next, we look at our equation, XZ+YZ and see that we need two and gates, an or gate, and a not gate. You then just simply just connect these gates with their corresponding inputs YZ X Z XZ YZ+XZ 74LS08 (And Chip) 74LS32 (Or Chip) 74LS04 (Not Chip) Chips AOI gates are contained within chips. These chips each have 14 pins labeled 1-14. The 1st pin is located right of the notch, then is numbered counter-clockwise from there. A TTL 74LS08 chip contains 4 And gates A TTL 74LS04 chip contains 4 Not gates A TTL 74LS32 chip contains 4 Or Gates X Y Z First we would connect power and ground to the breadboard. +5 Volts Ground Depending on the breadboard, the switches may already be connected to power and ground Then we insert our chips And connect our ground and power through each of our chips Then we take a look at our equation XZ + YZ and connect our switches accordingly. YZ XZ Z XZ+YZ And finally, we connect our final output into an LED to check if it works Our Example 1 1 1 1 1 now fill in the rest with zeroes 0 0 0 0 1 Y Z YZ If your truth tables failed to match, then you must troubleshoot. You check the row of your truth table that doesn't match and make sure that part of your circuit is correct, although it shouldn't be or else you wouldn't be troubleshooting. There are also tools that tell you if a wire has a binary value of 1 or 0 that may help you troubleshoot if you can't find your problem. The end of our long journey, deep into digital electronics