Scribd
Upload
16 views

7-Digital Logic - Combinational Logic

Uploaded by

cevallos.hector11
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
16 views

7-Digital Logic - Combinational Logic

Uploaded by

cevallos.hector11
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/ 18

Digital Logic Basics

Ch. 2
Combinational Logic
Basic Gates
• Combinational logic: circuits where the output depends on the
present value(s) of the inputs.

• Gate: a digital circuit that implements the most basic functions


possible on the binary number system

• Logic states: TRUE being equivalent to a 1, and FALSE being


equivalent to a 0
Basic Gates
• Three common ways
to represent the
functionality of a
basic gate: symbol,
truth table, logic
expression
Basic Gates
Boolean Algebra
• Core operations:

- conjunction: ∧, equivalent to the AND operation


A•B
- disjunction: ∨, equivalent to the OR operation
A+B
- negation: ¬, equivalent to the NOT operation
A’
Boolean Algebra
• Axioms

- Boolean Values: A = 0 if A ≠ 1, conversely A = 1 if A ≠ 0

- Definition of Logical Negation: if A = 0 then A’ = 1, conversely, if A = 1


then A’ = 0

- Definition of a Logical Product: A ∙ B = 1 if A = B = 1 and A ∙ B = 0


otherwise

- Definition of Logical Precedence: NOT precedes AND, AND precedes OR


Boolean Algebra
• Boolean algebra theorems
Boolean Algebra
Combinational Logic Synthesis
• Canonical sum of products (SOP) topology is based on minterms

• A minterm is a product term (an AND operation) that will be true for
one and only one input code. The minterm must contain every input
variable in its expression.

• Complements (A’) are applied to the input variables as necessary in


order to produce a true output for the individual input code. The
word literal to describe an input variable which may or may not be
complemented.
Combinational Logic Synthesis
Combinational Logic Synthesis
• Canonical sum: unminimized logic expression

Example:
For the following truth table, find the canonical sum of
products logic expression & logic circuit.
Combinational Logic Synthesis
Combinational Logic Synthesis
• Minterm list: a compact way to describe the functionality of a logic
circuit by simply listing the row numbers that correspond to an output
of 1 in the truth table
• A minterm list contains the same information as the truth table
Example:
For the following truth table, find the minterm list.
Combinational Logic Synthesis
Combinational Logic Synthesis

Example:
For the following minterm list:
F = ΣA,B,C (0, 3, 7)
(a) find the truth table
(b) Find the canonical sum of products logic expression
(c) Find the canonical sum of products logic diagram
Combinational Logic Synthesis
Combinational Logic Synthesis
Example:
Simplify the problems and find the truth tables

You might also like