Scribd
Upload
0 views9 pages

Chapter 2_P4_Logic Circuit Design Using Sum-Product Functions

The document discusses the design of logic circuits using Sum of Products (SOP) and Product of Sums (POS) methods, focusing on a specific formula for three inputs (C, B, A). It provides a truth table and examples for building logic circuits based on these methods, emphasizing the importance of minimizing gate usage. The lecture is presented by Assoc. Prof. Nguyen Thanh Hai, PhD at the University of Technology and Education.

Uploaded by

Trương Quang Thịnh
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
0 views9 pages

Chapter 2_P4_Logic Circuit Design Using Sum-Product Functions

The document discusses the design of logic circuits using Sum of Products (SOP) and Product of Sums (POS) methods, focusing on a specific formula for three inputs (C, B, A). It provides a truth table and examples for building logic circuits based on these methods, emphasizing the importance of minimizing gate usage. The lecture is presented by Assoc. Prof. Nguyen Thanh Hai, PhD at the University of Technology and Education.

Uploaded by

Trương Quang Thịnh
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/ 9

University of Technology and Education

Faculty of Electrical & Electronic Engineering

Lecture:
DIGITAL SYSTEMS
Chapter 2:
Logic Circuit design using Sum-Product

Assoc. Prof. Nguyen Thanh Hai, PhD

1
University of Technology and Education
Faculty of Electrical & Electronic Engineering

Logic Gates and Boolean Algebra


Build a logic circuit using the following formula:

f (C , B, A)  CBA (0,1,3,4,6) (1)

(2)

Eq. (1) has the symbol of Sigma which means Sum of


Products (SOP) based on Level 1 (High)
Eq. (2) has the symbol of Pi which means Product of Sums
(POS) based on Level 0 (Low)

2
Assoc. Prof. Nguyen Thanh Hai, PhD
University of Technology and Education
Faculty of Electrical & Electronic Engineering

Logic Gates and Boolean Algebra

f (C , B, A)  CBA (0,1,3,4,6)
State C B A Y Corresponding to 5
ones of the output,
0 0 0 0 1 we have 5
1 0 0 1 1 products. Because
2 0 1 0 0 the expression is
Sum, so we add 5
3 0 1 1 1
products together
4 1 0 0 1 to produce the
5 1 0 1 0 logic expression
6 1 1 0 1 for drawing the
logic circuit.
7 1 1 1 0
3
Assoc. Prof. Nguyen Thanh Hai, PhD
University of Technology and Education
Faculty of Electrical & Electronic Engineering

Logic Gates and Boolean Algebra

f (C , B, A)  CBA (0,1,3,4,6)
Therefore, we use the method of Sum of Products to
produce the following expression:

From this expression, we can use logic gates for drawing


the logic circuit.

4
Assoc. Prof. Nguyen Thanh Hai, PhD
University of Technology and Education
Faculty of Electrical & Electronic Engineering

Logic Gates and Boolean Algebra


Build a logic circuit using the following formula:

f (C , B, A)  CBA (0,1,3,4,6) (1)

(2)

Eq. (1) has the symbol of Sigma which means Sum of


Product based on Level 1 (High)
Eq. (2) has the symbol of Pi which means Product of Sums
based on Level 0 (Low)

5
Assoc. Prof. Nguyen Thanh Hai, PhD
University of Technology and Education
Faculty of Electrical & Electronic Engineering

Logic Gates and Boolean Algebra


Similarly, we
design the logic
circuit based on
State C B A Y level 0 by taking
0 0 0 0 1 Product of Sums.
1 0 0 1 1
2 0 1 0 0
3 0 1 1 1
4 1 0 0 1
5 1 0 1 0
6 1 1 0 1
7 1 1 1 0
6
Assoc. Prof. Nguyen Thanh Hai, PhD
University of Technology and Education
Faculty of Electrical & Electronic Engineering

Logic Gates and Boolean Algebra

Therefore, we use the method of Product of Sums to


produce the following expression:

From this expression, we can use logic gates for drawing


the logic circuit.
However, when we need to calculate for simplifying the
expression for designing the circuit with the minimum gates,
we should use the method SOP, in this case, if an
expression has many level 0 at the output 7
Assoc. Prof. Nguyen Thanh Hai, PhD
University of Technology and Education
Faculty of Electrical & Electronic Engineering

Logic Gates and Boolean Algebra


Example:
Design a logic circuit that has three inputs, A, B and C, and whose
output will be HIGH only when a majority of the input is HIGH
Truth table
Input Output
1. Truth table
A B C Y
0 0 0 0 2. AND for each case
0 0 1 0 3. Sum-of-product expression
0 1 0 0 4. Implement the circuit
0 1 1 1 ABC
1 0 0 0
AB C
1 0 1 1
1 1 0 1 ABC
1 1 1 1 ABC
8
Assoc. Prof. Nguyen Thanh Hai, PhD
University of Technology and Education
Faculty of Electrical & Electronic Engineering

Logic Gates and Boolean Algebra

The End

9
Assoc. Prof. Nguyen Thanh Hai, PhD

You might also like