Haliç University

Faculty of Engineering

EEE213

ELECTRONIC CIRCUITS

’’ Logic Circuits’’

Lecturer: Asst.Prof. Zehra Merve Cinan

 Topics
• Logic Circuits
 Logic Functions
 Switch & Lamp Logic
 AND Logic
 OR Logic
 Logic Gates (Buffers, Inverters, AND Gates, OR Gates, NAND Gates,
NOR Gates, Exclusive-OR Gates, and Exclusive-NOR Gates)

2
Logic Circuits

Logic circuits are used extensively in digital

electronics. The basic logic gates, AND, OR, NAND, and
NOR are designed to be interconnected into larger, more
complex, logic circuit arrangements. You need to understand
how these circuits operate in order to understand a wide
range of digital circuits and systems.

Logic Gates

3
Logic Functions

Electronic logic circuits can be used to make simple decisions like:

If dark then put on the light.
&
If the temperature is less then 20 °C then connect the supply to the heater.
They can also be used to make more complex decisions like:
If ‘hour’ is greater than 11 and ‘24 hour clock’ is not selected then display the message ‘pm’.
All of these logical statements are similar in form. The first two are essentially:
If {condition} then {action}.
while the third is a compound statement of the form:
If {condition 1} and not {condition 2} then {action}.
Types of Basic Digital Logic Gates
Both of these statements can be readily implemented using straightforward electronic
circuits. Because this circuitry is based on discrete states and since the behaviour of the circuits
can be described by a set of logical statements, it is referred to as digital logic.

4
Switch & Lamp Logic
In the simple circuit shown in the figure, a battery is connected to a lamp via a
switch. There are two possible states for the switch, open and closed, but the lamp
will only operate when the switch is closed. We can summarize this using the table.
Since the switch can only be in one of the two states (i.e. open or closed) at
any given time, the open and closed conditions are mutually exclusive. Furthermore,
since the switch cannot exist in any other state than completely open or completely Simple switch and lamp circuit
closed (i.e. there is no intermediate or half-open state) the circuit uses binary or ‘two-
state’ logic. The logical state of the switch can be represented by the binary digits, 0
and 1. For example, if logical 0 is synonymous with open (or ‘off’) and logical 1 is
equivalent to closed (or ‘on’), then: Simple switching logic

Switch open (off) = 0

Switch closed (on) = 1

We can now rewrite the truth table in terms of the binary states as shown in the
second figure where:
No light (off) = 0 Truth table for the switch and lamp
Light (on) = 1

5
AND Logic

Now consider the circuit with two switches shown in the figure. Here, the lamp
will only operate when switch A is closed and switch B is closed. Since there are two
switches (A and B) and there are two possible states for each switch (open or closed),
there is a total of four possible conditions for the circuit, as can be seen in the table.
Since each switch can only be in one of the two states (i.e. open or closed) at AND switch and lamp logic
any given time, the open and closed conditions are mutually exclusive. Furthermore,
since the switches cannot exist in any other state than completely open or completely
closed (i.e. there are no intermediate states) the circuit uses binary logic. We can thus
represent the logical states of the two switches by the binary digits, 0 and 1.
Once again, if we adopt the convention that an open switch can be represented Simple AND switching logic

by 0 and a closed switch by 1, we can rewrite the truth table in terms of the binary
states shown in the last figure where:

No light (off) = 0
Light (on) = 1

Truth table for the switch and lamp

6
7
OR Logic

In the figure, the lamp will operate when either of the

two switches is closed. There is a total of four possible OR switch and lamp logic

conditions for the circuit, as can be seen in the table.

Once again, adopting the convention that an open
switch can be represented by 0 and a closed switch by 1, we
can rewrite the truth table in terms of the binary states as Simple OR switching logic

shown in the figure.

Truth table for OR logic

8
9
Example: Figure shows a simple switching circuit. Describe the
logical state of switches A, B and C in order to operate the lamp.
Illustrate your answer with a truth table.

Solution:

10
Example: Figure shows a simple switching circuit. Describe the
logical state of switches A, B and C in order to operate the lamp.
Illustrate your answer with a truth table.

Solution:

In order to operate the lamp, switch A and either switch B or

switch C must be operated. The truth table is shown in the figure.

11
Logic Gates

Logic gates are circuits designed to produce the basic logic

functions, AND, OR, etc. These circuits are designed to be
interconnected into larger, more complex, logic circuit
arrangements. For each gate, we have included its British Standard
(BS) symbol together with its American Standard (MIL/ ANSI)
symbol. We have also included the truth tables and Boolean
expressions (using ‘ + ’ to denote OR, ‘·’ to denote AND, and ‘−’ to
denote NOT). Note that, while inverters and buffers each have only
one input, exclusive-OR gates have two inputs and the other basic
gates (AND, OR, NAND, and NOR) are commonly available with
up to eight inputs.

Logic Gate Symbols

12
Buffers

Buffers do not affect the logical state of a digital signal (i.e. a

logic 1 input results in a logic 1 output whereas a logic 0 input
results in a logic 0 output). Buffers are normally used to provide
extra current drive at the output but can also be used to regularize
the logic levels present at an interface. The Boolean expression for
the output, Y, of a buffer with an input, X, is:

Symbols and truth table for a buffer

13
Inverters

Inverters are used to complement the logical state (i.e. a logic 1

input results in a logic 0 output and vice versa). Inverters also
provide extra current drive and, like buffers, are used in interfacing
applications where they provide a means of regularizing logic levels
present at the input or output of a digital system. The Boolean
expression for the output, Y, of a buffer with an input, X, is:

Symbols and truth table for an inverter

14
AND Gates
AND gates will only produce a logic 1 output when all inputs
are simultaneously at logic 1. Any other input combination results in
a logic 0 output. The Boolean expression for the output, Y, of an
AND gate with inputs, A and B, is:
Symbols and truth table for an AND gate

15
OR Gates
OR gates will produce a logic 1 output whenever any one, or
more, inputs are at logic 1. Putting this another way, an OR gate will
only produce a logic 0 output whenever all of its inputs are
simultaneously at logic 0. The Boolean expression for the output, Y,
of an OR gate with inputs A and B is:
Symbols and truth table for an OR gate

16
NAND Gates
NAND (i.e. NOT-AND) gates will only produce a logic 0
output when all inputs are simultaneously at logic 1. Any other input
combination will produce a logic 1 output. A NAND gate, therefore,
is nothing more than an AND gate with its output inverted. The circle
Symbols and truth table for a NAND gate
shown at the output denotes this inversion. The Boolean expression
for the output, Y, of a NAND gate with inputs A and B is:

17
NOR Gates
NOR (i.e. NOT-OR) gates will only produce a logic 1 output
when all inputs are simultaneously at logic 0. Any other input
combination will produce a logic 0 output. A NOR gate, therefore, is
simply an OR gate with its output inverted. A circle is again used to
Symbols and truth table for a NOR gate
indicate inversion. The Boolean expression for the output, Y, of a
NOR gate with inputs, A and B, is:

18
Exclusive-OR Gates
Exclusive-OR gates will produce a logic 1 output whenever
either one of the inputs is at logic 1 and the other is at logic 0.
Exclusive-OR gates produce a logic 0 output whenever both inputs
have the same logical state (i.e. when both are at logic 0 or both are
at logic 1). The Boolean expression for the output, Y, of an Symbols and truth table for an exclusive-OR gate

exclusive-OR gate with inputs A and B is:

19
Exclusive-NOR Gates
Exclusive-NOR gates will produce a logic 0 output whenever either one of the inputs is at logic 1 and the other is at
logic 0. Exclusive-NOR gates produce a logic 1 output whenever both inputs have the same logical state (i.e., when both
are at logic 0 or both are at logic 1). The Boolean expression for the output, Y, of an exclusive-NOR gate with inputs, A
and B, is:

𝑌 = 𝐴. 𝐵ത + 𝐵. 𝐴ҧ

20
Example: A logic circuit is to be constructed that will produce a logic 1 output whenever two or more of its
three inputs are at logic 1.

Solution:

21
Example: A logic circuit is to be constructed that will produce a logic 1 output whenever two or more of its
three inputs are at logic 1.

Solution:

22
Example: Show how an arrangement of basic logic gates (AND, OR, and NOT) can be used to produce the
exclusive-OR function.

Solution:

23
Example: Show how an arrangement of basic logic gates (AND, OR, and NOT) can be used to produce the
exclusive-OR function.

Solution:

These expressions can be obtained using two two-input AND gates and the result (i.e. P and Q) can then be applied to
an OR gate with two inputs. A and B can be produced using inverters.

24
 Important Formulas
Buffers & Inverters:

AND Gates:

OR Gates:

NAND Gates:

NOR Gates:

Exclusive-OR Gates & Exclusive-NOR Gates:

𝑌 = 𝐴. 𝐵ത + 𝐵. 𝐴ҧ
25
26
Asst.Prof. Zehra Merve Cinan
Faculty of Engineering
Department of Electrical and Electronics Engineering,
8th Block, Floor: 2
Office: 2521

[email protected]

27