Scribd
Upload
24 views20 pages

Digital Logic Circuit and Switching Theory

This document discusses combinational logic circuits. It defines canonical forms like sum of products (SOP) and product of sums (POS) that allow comparison of logic expressions. It explains how to derive SOP and POS expressions from truth tables using minterms and maxterms. Standard order and indexing of variables in minterms and maxterms is also described. The document outlines the process for designing combinational logic circuits and provides an example of designing a circuit to control a light based on switches in three locations. It also discusses logic simplification techniques and universal gates like NAND and NOR that can be used to implement any logic function.

Uploaded by

kathrine
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views20 pages

Digital Logic Circuit and Switching Theory

This document discusses combinational logic circuits. It defines canonical forms like sum of products (SOP) and product of sums (POS) that allow comparison of logic expressions. It explains how to derive SOP and POS expressions from truth tables using minterms and maxterms. Standard order and indexing of variables in minterms and maxterms is also described. The document outlines the process for designing combinational logic circuits and provides an example of designing a circuit to control a light based on switches in three locations. It also discusses logic simplification techniques and universal gates like NAND and NOR that can be used to implement any logic function.

Uploaded by

kathrine
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

ECE 4104

Digital Logic Circuit and Switching Theory


Combinational Logic Circuits

INPUTSOUTPUT
A B C F
0 0 0
A 0 0 1
0 1 0
B F
0 1 1
1 0 0
C 1 0 1
1 1 0
1 1 1

2
Canonical Forms
Allows comparison for equality.
Has a correspondence to the truth tables
Minterms
Minterms are AND terms with every variable present in either true or
complemented form. It is also known as Sum of Products (SOP) terms.
Maxterms
Maxterms are OR terms with every variable in true or complemented form.
It is also known as Product of Sums (POS) terms.

3
Standard Order
Minterms and maxterms are designated with a subscript.
The subscript is a number, corresponding to a binary pattern
The bits in the pattern represent the complemented or normal state
of each variable listed in a standard order.
All variables will be present in a minterm or maxterm and will be
listed in the same order (usually alphabetically)

4
Purpose of the Index
The index for the minterm or maxterm, expressed as a binary number, is used to
determine whether the variable is shown in the true form or complemented
form.
For Minterms:
1 means the variable is Not Complemented and
0 means the variable is Complemented.
For Maxterms:
0 means the variable is Not Complemented and
1 means the variable is Complemented.

5
SOP and POS Derivation from
Truth Table
SOP Equation
A B C F all combinations with output level 1.
0 0 0 1 write the terms in product form.
0 0 1 1 if the variable is 1 write it in true form.
0 1 0 0 if the variable is 0 write in complement.
0 1 1 1 POS Equation
1 0 0 0 all combinations with output level 0.
1 0 1 0 write the terms in sum form.
if the variable is 1 write it in complement.
1 1 0 0
if the variable is 0 write in true form.
1 1 1 1

6
Combinational Logic Circuit
Design Process

7
Combinational Logic Circuits
Why Simplify?
Reduction in the hardware of a logic circuit can be achieved by simplifying its
Boolean expression(s). Main benefits are:
Reduction in the number of gates or ICs and interconnection wires/tracks.
Smaller physical space (in PCB or IC) is occupied by the design.
Higher circuit speed.
Lower power consumption and heat generated.
Easier testing and finding fault.
Lower cost.
Improved reliability of the circuit due to lower gate count as well as number of
interconnections.

8
Logic Simplification Techniques
Algebraic method
Simplify the expression using Boolean theorems. Mainly two steps involved:
Convert original expression into sum-of products (SOP) form (DeMorgan
theorem, ...).
Check product term for common factors and perform factoring.
Karnaugh Map (K-map)
Map Entered Variable (MEV)
Tabular Methods
Quine-McClusky (Q-M) Method
Suitable for computer implementation.
Partially heuristic method where optimal solution is not guaranteed.
Petricks Algorithm
A modified Quine-McClusky method.

9
Example
A light(L) is placed at the center of a T corridor and wished to be
controlled in the three locations(S1,S2,and S3). Design a control
circuit that will turn ON and OFF the light every time a switch
change status in any of the three location. The initial position of the
three switches is OFF and the light status is OFF.

10
Illustration

11
Answer
Truth Table SOP Equation
S1 S2 S3 L L S1S 2S 3 S1S 2S 3 S1S 2S 3 S1S 2S 3
0 0 0 0
0 0 1 1
0 1 0 1 Simplified SOP Equation
0 1 1 0
1 0 0 1 L S1 (S 2 S 3)
1 0 1 0
1 1 0 0
1 1 1 1

12
Answer

13
Universal Gates
NAND Equivalents

14
16
17
Universal Gates
NOR Equivalents

18
19
XOR

20

You might also like