Digital Logic Design
03 – Combinational Circuits
Introduction
Introduction
• Logic circuits for digital systems may be:
• Combinational
• Sequential
• A combinational circuit
• Outputs at any time are determined from the present combination of inputs
• Performs the operation specified by a set of Boolean functions
3
Introduction
• Sequential Circuits
• Employ storage elements in addition to logic gates
• Their outputs
• Are a function of inputs and state of the storage elements
• Determined not only by present values of inputs, but also by past inputs
• Circuit behavior must be specified by a time sequence of inputs and internal
states
4
Combinational Circuits
Combinational Circuits
• Combinational circuits consist of
• Input variables
• Logic gates
• Accept signals from the inputs
• Generate signals to the output (after a delay)
• Output variables
• Combinational circuits have no memory elements nor feedback
paths
6
Combinational Circuits
• For input variables, there are possible input combinations
• For each possible input combination there is only one possible
output value
7
Combinational Circuits
• Analysis
• Given a circuit, find out its function
• Function may be expressed as:
• Boolean function
• Truth table
• Synthesis
• Given a desired function, determine its circuit
• Function may be expressed as:
• Boolean function
• Truth table
8
Combinational Circuit Analysis
Combinational Circuit Analysis
• By analysis we mean obtaining a formal description of the circuit’s
logic function
• Given a logic diagram, there are several ways to obtain a formal logic
description
• Truth table
• Logic expression
Analysis Procedure: Truth Table
Find the truth table that describes the combinational circuit in the figure
Analysis Procedure: Truth Table
12
Analysis Procedure: Truth Table
13
Analysis Procedure: Truth Table
14
Analysis Procedure: Truth Table
15
Analysis Procedure: Truth Table
16
Analysis Procedure: Truth Table
17
Analysis Procedure: Truth Table
18
Analysis Procedure: Truth Table
19
Analysis Procedure: Boolean Expression
• To obtain the output Boolean function from a logic diagram:
1. Label all gate outputs that are functions of input variables
• Determine the Boolean functions for each gate output
2. Label the gates that are functions of input variables and previously labelled
gates
• Find the Boolean function of these gates
3. Repeat the process in step 2 until all the outputs are obtained
4. Obtain the output Boolean functions in terms of input variables
20
Analysis Procedure: Boolean Expression
• Example:
𝑻𝟐 = 𝑨𝑩𝑪
𝑻𝟏 = 𝑨 + 𝑩 + 𝑪
𝑻𝟑 = 𝑨𝑩′𝑪′ + 𝑨′𝑩𝑪′ + 𝑨′𝑩′𝑪
𝑭’𝟐 = (𝑨’ + 𝑩’)(𝑨’ + 𝑪’)(𝑩’ + 𝑪’)
𝑭𝟐 = 𝑨𝑩 + 𝑨𝑪 + 𝑩𝑪
𝑭𝟏 = 𝑨𝑩′𝑪′ + 𝑨′𝑩𝑪′ + 𝑨′𝑩′𝑪 + 𝑨𝑩𝑪
𝑭𝟐 = 𝑨𝑩 + 𝑨𝑪 + 𝑩𝑪 21
Analysis Procedure: Boolean Expression
Analysis Procedure: Boolean Expression
Analysis Procedure: Boolean Expression
Combinational Circuit Synthesis
Design vs Synthesis
Digital Logic Circuit
Concept Digital Design Process
or System
Formal specification Physical logic circuit
of the required Synthesis Process that performs the
function function
Example 1
• 4-bit Prime number detector
• Given a 4-bit input combination , produce a 1 output for
, and 0 otherwise.
•
𝑵𝟑 𝑵𝟐 𝑵𝟏 𝑵𝟎 𝑭
Example 1 0
0
0
0
0
0
0
1
0
1
0 0 1 0 1
• Truth Table 0 0 1 1 1
0 1 0 0 0
0 1 0 1 1
0 1 1 0 0
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 1
1 1 0 0 0
1 1 0 1 1
1 1 1 0 0
1 1 1 1 0
Example 2
• Alarm Circuit
• The output is 1 if the input is 1, or if the input is 1,
the input is 0, and the house is not secure; the house is secure if
the , , and inputs are all 1.
•
•
•
Example 2
Example 2
•
NAND and NOR Implementations
NAND Gate
• The NAND gate is a universal
gate
• Can implement any digital system
• Complement operation is obtained
from one-input NAND gate
• AND operation requires two NAND
gates
• OR operation is achieved through
NAND gate with additional
inverters in each input
34
NAND Gate
• Two graphic symbols for a NAND gate
35
Two-Level Implementation
• NAND-NAND = sum-of-products
• Example:
36
Two-Level Implementation
• Example:
37
Multi-Level Implementation
• Example:
38
Multi-Level Implementation
• Example:
39
NOR Gate
• NOR function is the dual of NAND function
• NOR function is also universal
40
NOR Gate
• Two graphic symbols for NOR gate
41
Two-Level Implementation
• NOR-NOR = Product-of-Sums
• Example:
42
Multi-Level Implementation
• Example:
43
