0% found this document useful (0 votes)
57 views

Lecture Slides Week 05

The document discusses basic combinational logic circuits including their implementation using sum-of-products and product-of-sums forms. It also describes the logic gates of AND, OR, NAND, NOR, XOR and XNOR through their truth tables, Boolean expressions, and example timing diagrams. Implementation of logic functions using NAND and NOR gates is also covered.

Uploaded by

Farrukh Abbas
Copyright
© © All Rights Reserved
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
0% found this document useful (0 votes)
57 views

Lecture Slides Week 05

The document discusses basic combinational logic circuits including their implementation using sum-of-products and product-of-sums forms. It also describes the logic gates of AND, OR, NAND, NOR, XOR and XNOR through their truth tables, Boolean expressions, and example timing diagrams. Implementation of logic functions using NAND and NOR gates is also covered.

Uploaded by

Farrukh Abbas
Copyright
© © All Rights Reserved
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

DLD 5th WEEK LECTURE

1
Combinational Logic Circuits

In Sum-of-Products (SOP) form, basic combinational circuits


can be directly implemented with AND-OR combinations if
the necessary complement terms are available.

Product terms
A
AB
B
C CD
D AB + CD + . . . + JK
Sum-of-products
J
JK
K
Product term

2
Combinational Logic Circuits

An example of an SOP implementation is shown. The SOP


expression is an AND-OR combination of the input variables
and the appropriate complements.

A
B ABC
C X = ABC + DE SOP

D
DE
E

3
Combinational Logic Circuits

When the output of a SOP form is inverted, the circuit is


called an AND-OR-Invert circuit. The AOI configuration
lends itself to product-of-sums (POS) implementation.
An example of an AOI implementation is shown. The output
expression can be changed to a POS expression by applying
DeMorgan’s theorem twice.
A
B ABC
C X = ABC + DE X = ABC + DE AOI

D X = (ABC)(DE) DeMorgan
E DE X = (A + B + C)(D + E) POS

4
Exclusive-OR Logic

Inputs Output
The truth table for an exclusive-OR gate is A B X
0 0 0
Notice that the output is HIGH whenever 0 1 1
A and B disagree. 1 0 1
1 1 0
The Boolean expression is X = AB + AB
The circuit can be drawn as
A
Symbols:
X =1

Distinctive shape Rectangular outline


B

5
Exclusive-NOR Logic

Inputs Output
The truth table for an exclusive-NOR gate is A B X
0 0 1
Notice that the output is HIGH whenever 0 1 0
0
A and B agree. 1
1
0
1 1
The Boolean expression is X = AB + AB
The circuit can be drawn as
A
Symbols:
X
B
=1

Distinctive shape Rectangular outline

6
Timing Diagrams of Logic Gates

The functional behavior of a logic gate or circuit is realized by


the three processes, as follows:

1. Truth Table: Truth table is a prescribed specification table that


explains the input-output relation of logic circuit or expresses the
Boolean expression.

2. Logic Equation: In logic equations, the output is expressed in


terms of inputs according to the truth table or logic circuit.

3. Timing Diagram: Timing diagram indicates input and output


waveforms of logic circuit or its Boolean expression. Basically it
represents truth table.

7
The Inverter

A A X
X
The inverter performs the Boolean NOT operation. When the
input is LOW, the output is HIGH; when the input is HIGH,
the output is LOW.

Input Output
A X
LOW (0) HIGH (1)
HIGH (1) LOW(0)

The NOT operation (complement) is shown with an overbar.


Thus, the Boolean expression for an inverter is X = A.

8
The Inverter & Waveforms

A X A X

Example waveforms:
A
X
A group of inverters can be used to form the 1’s complement
of a binary number: Binary number
1 1 0 1 0 0 1 0

0 0 1 0 1 1 0 1
1’s complement

9
The AND Gate

A A
X & X
B B

The AND gate produces a HIGH output when all inputs are
HIGH; otherwise, the output is LOW. For a 2-input gate,
the truth table is Inputs Output
A B X
0 0 0
0 1 0
1 0 0
1 1 1

The AND operation is usually shown with a dot between the


variables or it may be implied without dot. Thus, the AND
operation is written as X = A .B or X = AB.

10
The AND Gate & Waveforms

A A
X & X
B B

Example waveforms:
A
B
X
The AND operation is used in computer programming as a
selective mask. If you want to retain certain bits of a binary
number but reset the other bits to 0, you could set a mask
with 1’s in the position of the retained bits & 0’s for reset.
If the binary number 10100011 is ANDed with
the mask 00001111, what is the result? 00000011
11
The OR Gate

A X A ≥1 X
B B

The OR gate produces a HIGH output if any input is HIGH;


if all inputs are LOW, the output is LOW. For a 2-input gate,
the truth table is Inputs Output
A B X
0 0 0
0 1 1
1 0 1
1 1 1

The OR operation is shown with a plus sign (+) between the


variables. Thus, the OR operation is written as X = A + B.

12
The OR Gate & Waveforms

A X A ≥1 X
B B

Example waveforms:
A
B
X
The OR operation can be used in computer programming to set certain
bits of a binary number to 1.
ASCII letters have a 1 in the bit 5 position for lower case letters
and a 0 in this position for capitals. (Bit positions are numbered
from right to left starting with 0.) What will be the result if you
OR an ASCII letter with the 8-bit mask 00010000?
The resulting letter will be lower case.
13
The NAND Gate

A X A & X
B B
The NAND gate produces a LOW output when all inputs
are HIGH; otherwise, the output is HIGH. For a 2-input
gate, the truth table is Inputs Output
A B X
0 0 1
0 1 1
1 0 1
1 1 0

The NAND operation is shown with a dot between the


variables and an overbar covering them. Thus, the NAND
operation is written as X = A .B (Alternatively, X = AB.)

14
The NAND Gate & Waveforms

A X A & X
B B
Example waveforms:
A
B
X
The NAND gate is particularly useful because it is a
“universal” gate – all other basic gates can be constructed
from NAND gates.
How would you connect a 2-input NAND gate
to form a basic inverter?

15
The NOR Gate

A X A ≥1 X
B B

The NOR gate produces a LOW output if any input is


HIGH; if all inputs are HIGH, the output is LOW. For a
2-input gate, the truth table is
Inputs Output
A B X
0 0 1
0 1 0
1 0 0
1 1 0
The NOR operation is shown with a plus sign (+) between
the variables and an overbar covering them. Thus, the NOR
operation is written as X = A + B.
16
The NOR Gate & Waveforms

A X A ≥1 X
B B

Example waveforms:
A
B
X
The NOR operation will produce a LOW if any input is HIGH.
+5.0 V

When is the LED is ON for the circuit shown? 330 W

A
The LED will be ON when any B X
C
of the four inputs are HIGH. D

17
The XOR Gate

A X A =1 X
B B

The XOR gate produces a HIGH output only when both


inputs are at opposite logic levels. The truth table is
Inputs Output
A B X
0 0 0
0 1 1
1 0 1
1 1 0

The XOR operation is written as X = AB + AB.


Alternatively, it can be written with a circled plus sign
between the variables as X = A + B.

18
The XOR Gate & Waveforms

A X A =1 X
B B

Example waveforms:
A
B
X
Notice that the XOR gate will produce a HIGH only when exactly one
input is HIGH.
If the A and B waveforms are both inverted for the above
waveforms, how is the output affected?

There is no change in the output.

19
The XNOR Gate

A X A =1 X
B B

The XNOR gate produces a HIGH output only when both


inputs are at the same logic level. The truth table is
Inputs Output
A B X
0 0 1
0 1 0
1 0 0
1 1 1
The XNOR operation shown as X = AB + AB. Alternatively,
the XNOR operation can be shown with a circled dot
between the variables. Thus, it can be shown as X = A . B.

20
The XNOR Gate & Waveforms

A X A =1 X
B B

Example waveforms:
A
B
X
Notice that the XNOR gate will produce a HIGH when both inputs are the
same. This makes it useful for comparison functions.
If the A waveform is inverted but B remains the same, how is
the output affected?

The output will be inverted.

21
Combinational Logic circuit & Waveforms

For combinational circuits with pulsed inputs, the output


can be predicted by developing intermediate outputs and
combining the result. For example, the circuit shown can
be analyzed at the outputs of the OR gates:

t0 t1 t2 t3 t4 t5 t6 t7 t8 t9

A X
A
B B Z
C
C
D D Y
X
Y
Z

22
Combinational Logic circuit & Waveforms

Alternatively, you can develop the truth table for


the circuit and enter 0’s and 1’s on the waveforms. Inputs Output
Then read the output from the table. D C B A X
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
A
G1 0 0 1 1 0
B 0 1 0 0 1
G3 X 0 1 0 1 1
C 0 1 1 0 1
G2 1
D 0 1 1 1
1 0 0 0 1
A 0 1 0 1 0 1 0 1 0 1 1 0 0 1 0
1 0 1 0 1
B 0 1 1 0 0 1 1 0 0 1 1 0 1 1 1
1 1 0 0 1
C 0 0 0 1 1 1 1 0 0 0
1 1 0 1 0
D 0 0 0 0 0 0 0 1 1 1 1 1 1 0 1
1 1 1 1 1
X 0 0 0 0 1 1 1 0 1 1

23

You might also like