Professional Documents
Culture Documents
Two examples are considered which illustrate the analysis, simplification and
representation of Logic Circuits and Boolean expressions. In both the examples, a
Boolean expression representing the Logic Circuit is developed, the Boolean expression
is evaluated and a function table is implemented that represents the Boolean expression
and the function of the Logic Circuit. Each Boolean expression is also simplified into
SOP or POS form, the simplified expression is presented in a function table format. The
original and the simplified expressions are verified to show identical functions.
Example 1
1. Finding the Boolean Expression
A.B
B A.B + A.B.C.D
A
A.B.C.D
C.D
The circuit can be represented by a Boolean Expression. Starting from the left
hand side
• Output of NOT gate 1 is B
• Output of NOT gate 2 is A
• Output of two input AND gate 3 is A.B (product of A and B
• Output of two input AND gate 4 is C.D (product of C and D)
• Output of three input NAND gate 5 is A.B.C.D NOT(product of A , B and CD)
• Output of two input NOR gate 6 is A.B + A.B.C.D NOT(sum of A.B and A.B.C.D )
Input Output
A B C D F
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 1
0 1 0 0 0
0 1 0 1 0
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 0
1 1 0 1 0
1 1 1 0 0
1 1 1 1 0
Table 9.1 Truth Table representing function of Logic Circuit (fig. 9.1)
Input Output
A B C D F
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 1
0 1 0 0 0
0 1 0 1 0
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 0
1 1 0 1 0
1 1 1 0 0
1 1 1 1 0
The expression F represents a product term having four literals. Product term is
implemented using AND gates. Since, the product has four literals therefore a 4-input
AND gate is used. The literals A andB are implemented using NOT gates.
Example 2
1. Finding the Boolean Expression
A
A.B.C
( A.B.C).(C + D)
C
C+D
The circuit can be represented by a Boolean Expression. Starting from the left
hand side
• Output of NOT gate 1 is A
• Output of NOT gate 2 is C
• Output of three input AND gate 4 is A.B.C (product of A , B and C )
• Output of two input OR gate 5 is C + D (sum of C and D)
• Output of NAND gate 6 is ( A.B.C).(C + D) NOT(product of A.B.C and C + D )
Input Output
A B C D F
0 0 0 0 1
0 0 0 1 1
0 0 1 0 1
0 0 1 1 1
0 1 0 0 0
0 1 0 1 0
0 1 1 0 1
0 1 1 1 1
1 0 0 0 1
1 0 0 1 1
1 0 1 0 1
1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1
Table 9.2 Truth Table representing function of Logic Circuit (fig. 9.3)
The truth table shows that the variable D has no effect on the output of the circuit. The
truth table reduces to a three variable truth table. Table 9.3
= ( A.B.C).(C + D) = ( A.B.C) + (C + D)
Input Output
A B C F
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1
Table 9.3 Alternate Truth Table representing function of Logic Circuit (fig. 9.3)
Apply Demorgan’s first and second theorems to the first and second terms respectively
= ( A + B + C) + (C.D)
Applying Rule 9
= ( A + B + C) + (C.D)
= A + B + C(1 + D)
= A +B+C
expression =1 when any one literal is one
that is A=1 OR B =1 OR C=1
or A=1 OR B=0 OR C=1
Input Output
A B C F
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1
The expression F represents a sum term having three literals. Sum term is implemented
using OR gates. Since, the sum has three literals therefore a 3-input OR gate is used. The
literal B is implemented using NOT gate.
A C + BC
= A C(B + B) + ( A + A )BC
= ABC + ABC + ABC + ABC
= ABC + ABC + ABC
( A + B + C)( A + B + D)( A + B + C + D)
= ( A + B + C + D)( A + B + C + D)( A + B + C + D)( A + B + C + D)( A + B + C + D)
Any logic circuit can be implemented by using either the SOP, AND-OR
combination of gates or POS, OR-AND combination of gates. It is very simple to convert
from standard SOP to standard POS or vice versa. This helps in selecting an
implementation that requires the minimum number of gates. Secondly, the simplification
of general Boolean expression by applying the laws, rules and theorems does not always
result in the simplest form as the ability to apply all the rules depends on ones experience
and knowledge of all the rules.
Lastly, the PLDs are implemented having a general purpose structure based on
AND-OR arrays. A function represented by an expression in Standard SOP form can be
readily programmed.
A B C Minterms Maxterms
0 0 0 A.B.C A +B+C
0 0 1 A.B.C A +B+C
0 1 0 A.B.C A +B+C
0 1 1 A.B.C A +B+C
1 0 0 A.B.C A +B+C
1 0 1 A.B.C A +B+C
1 1 0 A.B.C A +B+C
1 1 1 A.B.C A +B+C
An SOP expression is equal to 1 when one or more product terms in the expression are
equal to 1.
A POS expression is equal to 0 when one or more product terms in the expression are
equal to 0.
A BC + ABC + ABC + A BC + ABC has the binary values 000, 010,011,101 and 111
Canonical Sum = ∑ A ,B ,C (0,2,3,5,7) = A BC + ABC + ABC + A BC + ABC
The missing binary values are 001, 100 and 110.
The POS expression is (A + B + C)(A + B + C)(A + B + C)
Canonical Product = ∏ A ,B,C (1,4,6)
Simplifies to
= A BC + ABC + ABC + A BC + ABC
Therefore ∑(0,2,3,5,7) = ∏(1,4,6)
To convert an SOP expression in a Truth table format, a truth table having input
combinations proportional to the domain of variables in the SOP expression is written.
Next the SOP expression is written in a standard SOP form. In the last step all the sum
terms present in the standard SOP expression are marked as 1 in the output.
A B + BC has a domain of three variables thus a truth table having 8 input and
output combinations is required. The SOP expression is converted into standard SOP
expression
A B(C + C) + BC(A + A) = A BC + A BC + ABC + ABC = ABC + A BC + A BC + ABC
Marking the outputs in the truth table as 1 for sum terms that are present in the standard
SOP.
Input Output
A B C F
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1
in a Truth table format, a truth table having input combinations proportional to the
domain of variables in the POS expression is written. Next the POS expression is written
in a standard POS form. In the last step all the product terms present in the standard POS
expression are marked as 0 in the output.
(A + B)(B + C) has a domain of three variables thus a truth table having 8 input
and output combinations is required. The POS expression is converted into standard POS
expression
(A + B + CC)(A A + B + C) = (A + B + C)(A + B + C)(A + B + C)(A + B + C)
Marking the outputs in the truth table as 0 for product terms that are present in the
standard POS
Input Output
A B C F
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1