We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 23
LESSON 2
TOPIC 2.1: CONCEPT OF LOGIC CIRCUITS
Logic Circuit is a computer switching circuit that consists of a number of logic gates and performs logical operations on data. Logic circuits are the basic building blocks used to realize consumer and industrial products that incorporate digital electronics. Figure 1: The lamp is ON only if switch 1 is ON and switch 2 is ON, but at no other time. We would say that this circuit performs an AND function Figure 2: Here the lamp is ON if switch 1 is ON or switch 2 is ON. We say that this circuit thus performs an OR function.
TOPIC 2.2/2.3: TYPES OF LOGIC GATES AND ITS BOOLEAN
TRUTH TABLE A basic circuit which performs logical operations such as AND or OR is referred to as a gate. A logic gate is a fundamental building blocks of a digital circuit. The terminals are represented by either low (0) or high (1) binary conditions. There are seven (7) basic logic gates: AND, OR, NOT NAND, NOR, and XOR. The “AND” Gate A High (1) output results only if both the inputs to the AND gate are High (1). If neither or only one input to the AND gate is High (1), a Low output results. The “OR” Gate A High (1) output results only if one or both inputs to the gate is High (1). If neither input is High (1), a Low output (0) results. The “NOT” Gate This gate is called an inverter. This gate has only one input and one output, and changes a Low (0) input to a High (1) output, and vice versa. An inverter is also said to complement or negate the input signal The “XOR” Gate The exclusive-OR, or XOR function is the same as an OR function, except when both inputs are high (1), and in this case the output is low (0). Another way of looking at the 2 input XOR function is that it gives a high (1) output if the two inputs are different. The “NAND” Gate Negated AND or NOT AND is a logic gate which produces an output that is false only if all its output is true. A Low (0) output result only if both inputs to the gate are high (1); if one or both inputs are Low (0), a High (1) output results. The “NOR” Gate Negated OR or NOT OR. A High (1) output results if both the inputs to the gate is Low (0); if both or one of the input is High (1), a Low (0) output results. Exercise 7 DIRECTION: Write down the Boolean Expressions for the following examples: 1. NOT X ………………………………………… 2. R AND T ………………………………………… 3. S OR R ………………………………………… 4. C EXOR G ………………………………………… 5. NOT B AND C ………………………………………… 6. NOT X OR NOT Y ………………………………………… 7. P EXOR NOT B ………………………………………… 8. NOT (A AND B) ………………………………………… 9. X NOR Y ………………………………………… 10. X AND Y ………………………………………… TOPIC 2.4: DERIVING A BOOLEAN EXPRESSION FROM A TRUTH TABLE Nowadays, computers have become an integral part of life as they perform many tasks and operations in quite a short span of time. One of the most important functions of the CPU in a computer is to perform logical operations by utilizing hardware like Integrated Circuits, electronic circuits and software technologies. But, how these hardware and software perform such operations is a mysterious puzzle. In order to have a better understanding of such a complex issue, we must have to acquaint ourselves with the term Boolean Logic, developed by George Boole. For a simple operation, computers utilize binary digits rather than digital digits. All the operations are carried out by the Basic Logic gates. Consider the following truth table of a particular logic system. (Note: at this stage it does not matter what the system is meant to do). In this table there are four combinations of inputs that will produce an output at Q. In order to write down the Boolean Expression for the whole system we first have to write down the Boolean Equation for each line in the truth table where the output is a 1. All input variables (three in this case) must be included in each Boolean Equation on each line, as shown below Task 8 Consider the following truth table of a particular logic system. Determine the Boolean Expression for system?
Boolean Expression for system:………………………………………….
2 .
Boolean Expression for system:
…………………………………………………. 3. Now try one with four inputs, the process is exactly the same, it’s just that you now have four variables in each term TOPIC 2.5: DERIVING A BOOLEAN EXPRESSION FROM A LOGIC CIRCUIT Example 1: Derive the Boolean expression for the following logic circuit. This breaks down a large circuit into smaller more manageable chunks. It would be virtually impossible to write down the expression for Q immediately just by looking at the logic diagram, so don’t even try, you are more than likely to make a mistake. 1 Now we move on to look at the outputs of stage 2, stage 3, to arrive at the expression for the system as Task 9 DIRECTION: Derive the Boolean Expression for the output of the following logic systems. 1. 4.