Scribd
Upload
47 views20 pages

Week 4

Digital Logic Design discusses standard forms of Boolean expressions, including: 1) Sum-of-Products (SOP) form, where two or more product terms are summed. 2) Product-of-Sums (POS) form, where two or more sum terms are multiplied. 3) SOP and POS standard forms require that every variable in the domain appears in each term. Combinational logic circuits are built from logic gates like NAND, NOR, and NOT. They can implement SOP and POS forms directly. Universal gates like NAND and NOR can form all basic logic gates.

Uploaded by

NaEem Khan
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
47 views20 pages

Week 4

Digital Logic Design discusses standard forms of Boolean expressions, including: 1) Sum-of-Products (SOP) form, where two or more product terms are summed. 2) Product-of-Sums (POS) form, where two or more sum terms are multiplied. 3) SOP and POS standard forms require that every variable in the domain appears in each term. Combinational logic circuits are built from logic gates like NAND, NOR, and NOT. They can implement SOP and POS forms directly. Universal gates like NAND and NOR can form all basic logic gates.

Uploaded by

NaEem Khan
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/ 20

Digital Logic Design

Standard Form of Boolean Expression


Standard SOP and POS forms
 Boolean expressions can be written in the sum-of-products form
(SOP) or in the product-of-sums form (POS). These forms can
simplify the implementation of combinational logic, particularly
with PLDs. In both forms, an overbar cannot extend over more than
one variable.
 An expression is in SOP form when two or more product terms are
summed as in the following examples:

 An expression is in POS form when two or more sum terms are


multiplied as in the following examples:
Standard Form of Boolean Expression
In SOP standard form, every variable in the domain must appear in
each term. This form is useful for constructing truth tables or for
implementing logic in PLDs.
You can expand a nonstandard term to standard form by multiplying
the term by a term consisting of the sum of the missing variable and
its complement.
Standard Form of Boolean Expression
POS Standard form
 In POS standard form, every variable in the domain must appear
in each sum term of the expression.
 You can expand a nonstandard POS expression to standard form by
adding the product of the missing variable and its complement and
applying rule 12, which states that (A + B)(A + C) = A + BC.
Examples
Examples
Boolean Expression and Truth Table
Every truth table can be expressed in terms of the basic
Boolean operators AND, OR and NOT operators.
The circuits corresponding to those truth tables can be
build using AND, OR and NOT gates.
If the Boolean expressions can be written in the sum-
of-products form (SOP). The input in each line of a
truth table can be expressed in terms of AND’s and
NOT’s.
 If the Boolean expressions can be written in the
product -of-sum form (POS). The input in each line of
a truth table can be expressed in terms of OR’s and
NOT’s.
Boolean Expression and Truth Table
Example
Example
Combinational Logic Circuits

 Combinational Logic Circuits are made up from basic logic


NAND, NOR or NOT gates that are “combined” or connected
together to produce more complicated switching circuits. These
logic gates are the building blocks of combinational logic circuits.
An example of a combinational circuit is a decoder, which converts
the binary code data present at its input into a number of different
output lines, one at a time producing an equivalent decimal code at
its output.
 Combinational logic circuits can be very simple or very
complicated and any combinational circuit can be implemented
with only NAND and NOR gates as these are classed as “universal”
gates.
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
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
X=AB C+D E
C
D
E
Combinational Logic Circuits
Exclusive OR Logic
Notice that the output is HIGH whenever A and B disagree.
The Boolean expression is
X =A B +AB

B
Universal Gates

 NOR gates are also universal gates and can form all of the basic
gates.
 Nor as Inverter

A A

Nor as OR gate

A
A+ B
B
Universal Gates
Nor as AND gate

A
AB
B

Nor as NAND gate

A
AB
B
Universal Gates
NAND as Inverter NAND as AND gate

A A A
AB
B

NAND as OR gate NAND as NOR gate

A A
A+ B A+ B
B B
Example
Example
Example

You might also like