Curriculum Analysis:

General objective of the teaching unit: This teaching unit aims to teach the
trainees the construction of the logic gates and Boolean expression , the
fundamentals of its operation. It also presents the application of the logic
gates in different industrial areas.
Behavioral Objectives:
The trainees should be able to:
1. Understand the control circuits used in industrial applications.
2. Recognize the construction of the PLC and its fundamentals.
3. Understand the different programming methods.


4. Simulate an industrial process with a simple PLC program.
Department: Electrical Technology
Specializa
tion:
Electrical
Power
Course Name: Programmable Control Technology
Course
code:
ELT 205
Prerequisites: Electric Circuit 2 Semester 4
Syllabus:
Before:(number
system)
- Binary system
- Dismal system
- Octal and
hexadecimal
number system
In between (logic circuit):
- Logic gate part 1
- Logic gate part 2
- Boolean laws
The teaching unit presents applied and experiment
study for logic circuits and the programmable logic
controller. It also enables the student to draw the
control circuits and programs the PLC using the
Credit
Hours
3
Contact Hours (h/w) L 2
5. Inspect the control circuits, PLC, locate any faults and repair them.
Contact analysis
A logic gate 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 low (0) or high (1), represented by different
voltage levels. The logic state of a terminal can, and generally does, change
often, as the circuit processes data. In most logic gates, the low state is
approximately zero volts (0 V), while the high state is approximately five volts
positive (+5 V).
There are seven basic logic gates: AND, OR, XOR, NOT, NAND, NOR, and
XNOR.
The AND gate is so named because, if 0 is called "false" and 1 is called "true,"
the gate acts in the same way as the logical "and" operator. The following
illustration and table show the circuit symbol and logic combinations for an
AND gate. (In the symbol, the input terminals are at left and the output
terminal is at right.) The output is "true" when both inputs are "true."
Otherwise, the output is "false."



AND gate

Input 1 Input 2 Output
0 0 0
0 1 0
1 0 0
1 1 1

The OR gate gets its name from the fact that it behaves after the fashion of
the logical inclusive "or." The output is "true" if either or both of the inputs are
"true." If both inputs are "false," then the output is "false."
program required for industrial application. It also
train the trainees to test and maintain control
circuits.
P 2
T

OR gate

Input 1 Input 2 Output
0 0 0
0 1 1
1 0 1
1 1 1

The XOR ( exclusive-OR ) gate acts in the same way as the logical "either/or."
The output is "true" if either, but not both, of the inputs are "true." The output
is "false" if both inputs are "false" or if both inputs are "true." Another way of
looking at this circuit is to observe that the output is 1 if the inputs are
different, but 0 if the inputs are the same.


XOR gate
Input 1 Input 2 Output
0 0 0
0 1 1
1 0 1
1 1 0

A logical inverter , sometimes called a NOT gate to differentiate it from other
types of electronic inverter devices, has only one input. It reverses the logic
state.


Inverter or NOT gate
Input Output
1 0
0 1

The NAND gate operates as an AND gate followed by a NOT gate. It acts in
the manner of the logical operation "and" followed by negation. The output is
"false" if both inputs are "true." Otherwise, the output is "true."

NAND gate
Input 1 Input 2 Output
0 0 1
0 1 1
1 0 1
1 1 0

The NOR gate is a combination OR gate followed by an inverter. Its output is
"true" if both inputs are "false." Otherwise, the output is "false."

NOR gate
Input 1 Input 2 Output
0 0 1
0 1 0
1 0 0
1 1 0

The XNOR (exclusive-NOR) gate is a combination XOR gate followed by an
inverter. Its output is "true" if the inputs are the same, and"false" if the inputs
are different.

XNOR gate
Input 1 Input 2 Output
0 0 1
0 1 0
1 0 0
1 1 1
Using combinations of logic gates, complex operations can be performed. In
theory, there is no limit to the number of gates that can be arrayed together in
a single device. But in practice, there is a limit to the number of gates that can
be packed into a given physical space. Arrays of logic gates are found in
digital integrated circuits (ICs). As IC technology advances, the required
physical volume for each individual logic gate decreases and digital devices of
the same or smaller size become capable of performing ever-more-
complicated operations at ever-increasing speeds.

1) AND gate examples:
Electronic door will only open if it detects a person and the switch is set to
unlocked.
Microwave will only start if the start button is pressed and the door close
switch is closed.

2) NOT gate examples:
Microwave will stop if the door is not closed.
House alarm will go off if the door is not closed.
Traffic light will operate normally if it's not in maintenance mode.

3) XNOR gate:
Now, that's a hard one. What will happen so long as it is not the case that
exactly one of two things are true?
Children will be content unless one has gotten their allowance and the other
hasn't.
Landing gear position okay light will extinguish if landing gear position and low
engine speed sensor disagree.
(Warning lights are a good example, since an XNOR is true if its inputs 'agree'
and false if they 'disagree'.)

Boolean algebra finds its most practical use in the simplification of logic
circuits. If we translate a logic circuit's function into symbolic (Boolean) form,
and apply certain algebraic rules to the resulting equation to reduce the
number of terms and/or arithmetic operations, the simplified equation may be
translated back into circuit form for a logic circuit performing the same function
with fewer components. If equivalent function may be achieved with fewer
components, the result will be increased reliability and decreased cost of
manufacture.
To this end, there are several rules of Boolean algebra presented in this
section for use in reducing expressions to their simplest forms. The identities
and properties already reviewed in this chapter are very useful in Boolean
simplification, and for the most part bear similarity to many identities and
properties of "normal" algebra. However, the rules shown in this section are
all unique to Boolean mathematics.

This rule may be proven symbolically by factoring an "A" out of the two terms,
then applying the rules of A + 1 = 1 and 1A = A to achieve the final result:

Please note how the rule A + 1 = 1 was used to reduce the (B + 1) term to 1.
When a rule like "A + 1 = 1" is expressed using the letter "A", it doesn't mean
it only applies to expressions containing "A". What the "A" stands for in a rule
like A + 1 = 1 is any Boolean variable or collection of variables. This is
perhaps the most difficult concept for new students to master in Boolean
simplification: applying standardized identities, properties, and rules to
expressions not in standard form.
For instance, the Boolean expression ABC + 1 also reduces to 1 by means of
the "A + 1 = 1" identity. In this case, we recognize that the "A" term in the
identity's standard form can represent the entire "ABC" term in the original
expression.
The next rule looks similar to the first one shown in this section, but is actually
quite different and requires a more clever proof:


Note how the last rule (A + AB = A) is used to "un-simplify" the first "A" term in
the expression, changing the "A" into an "A + AB". While this may seem like a
backward step, it certainly helped to reduce the expression to something
simpler! Sometimes in mathematics we must take "backward" steps to
achieve the most elegant solution. Knowing when to take such a step and
when not to is part of the art-form of algebra, just as a victory in a game of
chess almost always requires calculated sacrifices.
Another rule involves the simplification of a product-of-sums expression:

And, the corresponding proof:

To summarize, here are the three new rules of Boolean simplification
expounded in this section: