Unit 1: Logic
A logic gates is an elementary building block of a digital circuit. Most logic gates have two inputs and one output. At any given moment, every terminal is in one of the two binary conditions of HIGH (1s) or LOW (0s). There are 7 basic logic gates which are; AND, OR, XOR, NAND, NOR, XNOR AND NOT. Each one of these gates have a boolean equation and symbol. For example the equation for AND gate is A x B = Y (x represents multiplication).
Converting Binary and Hexadecimal numbers are discussed in Grade 11 curriculum.
Karnaugh Maps
A Karnaugh Map is a grid-like representation of a truth table. It is really just another way of presenting a truth table, but the mode of presentation gives more insight. A Karnaugh map has zero and one entries at different positions. Each position in a grid corresponds to a truth table entry.
Boolean expressions from Truth Tables
In designing digital circuits, the designer often begins with a truth table describing what the circuit should do. The design task is largely to determine what type of circuit will perform the function described in the truth table. While some people seem to have a natural ability to look at a truth table and immediately envision the necessary logic gate or relay logic circuitry for the task, there are procedural techniques available for the rest of us. This is why boolean expressions are very helpful and easy.
_ _ _ _
A Boolean expression may look something like: ( A + B + C ) * ( B + C + D ) * ( B + D ) = Y
We also learned how to create Gate diagrams from boolean equations. Here is an example of one with its boolean equation:
_ _ _ _
A Boolean expression may look something like: ( A + B + C ) * ( B + C + D ) * ( B + D ) = Y
We also learned how to create Gate diagrams from boolean equations. Here is an example of one with its boolean equation: