Scribd
Upload
67 views10 pages

Introduction - Combinational Logic

This document discusses combinational and sequential logic circuits. It defines combinational circuits as those consisting only of logic gates where the outputs are determined solely by the present input values. Sequential circuits contain both logic gates and storage elements, so their outputs depend on both the present inputs and past states. The document provides examples of common combinational logic functions and outlines the process for analyzing a combinational circuit to determine its truth table and output Boolean functions.

Uploaded by

Priyadarshini N
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
67 views10 pages

Introduction - Combinational Logic

This document discusses combinational and sequential logic circuits. It defines combinational circuits as those consisting only of logic gates where the outputs are determined solely by the present input values. Sequential circuits contain both logic gates and storage elements, so their outputs depend on both the present inputs and past states. The document provides examples of common combinational logic functions and outlines the process for analyzing a combinational circuit to determine its truth table and output Boolean functions.

Uploaded by

Priyadarshini N
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 10

Combinational Logic

Chapter 4
Combinational Vs Sequential Circuits

 Logic circuits may be combinational or sequential


 Combinational circuits:
 Consist of logic gates only
 Outputs are determined from the present values of inputs
 Operations can be specified by a set of Boolean functions
 Sequential circuits:
 Consist of logic gates and storage elements
 Outputs are a function of the inputs and the state of the
storage elements
 Depend not only on present inputs, but also on past values
 Circuit behavior must be specified by a time sequence of
inputs and internal states

Digital Circuits 2
4.1 Combinational Circuits
 A combinational circuits
n
 2 possible combinations of input values

n input Combinational m output


variables Logic Circuit variables

 Specific functions
 Adders, subtractors, comparators, decoders, encoders,
and multiplexers
 MSI circuits or standard cells

Digital Circuits 3
4-2 Analysis Procedure
 The “analysis” is the reverse of “design”.
 Analysis: determine the function that the
circuit implements
 Often start with a given logic diagram
 First step: make sure that circuit is
combinational and not sequential.
 Without feedback paths or memory elements
 Second step: obtain the output Boolean
functions or the truth table

Digital Circuits 4
4-2 Analysis Procedure
 Step 1:
 Label all gate outputs that are a function of input
variables
 Determine Boolean functions for each gate output

F2 = AB + AC + BC
T1 = A + B + C
T2 = ABC

Digital Circuits 5
4-2 Analysis Procedure
 Step 2:
 Label the gates that are a function of input
variables and previously labeled gates
 Find the Boolean function for these gates

T3 = F'2 T1
F1 = T 3 + T 2

Digital Circuits 6
4-2 Analysis Procedure
 Step 3:
 Obtain the output Boolean function in term of input
variables
 By repeated substitution of previously defined functions

F1 = T3 + T2 = F'2 T1 + ABC
= (AB + AC + BC)' (A + B + C) + ABC
= (A' + B' )(A' + C' )(B' + C' ) (A + B + C)
+ ABC
= (A' + B' C' )(AB' + AC' + BC' +B' C) +
ABC
= A' BC' + A' B' C + AB' C' + ABC

Digital Circuits 7
Truth Table
 To obtain the truth table from the logic diagram:
1. Determine the number of input variables
 For n inputs:

 2n possible combinations
 List the binary numbers from 0 to 2n -1 in a table
2. Label the outputs of selected gates
3. Obtain the truth table for the outputs of those gates
that are a function of the input variables only
4. Obtain the truth table for those gates that are a
function of previously defined variables at step 3
 Repeatedly until all outputs are determined

Digital Circuits 8
Truth Table

Digital Circuits 9
4-3 Design Procedure
 Input: the specification of the problem.
 Output: the logic circuit diagram or Boolean
functions.
 Step 1: determine the required number of inputs and
outputs from the specification
 Step 2: derive the truth table that defines the required
relationship between inputs and outputs
 Step 3: obtain the simplified Boolean function for
each output as a function of the input variables
 Step 4: draw the logic diagram and verify the
correctness of the design.

Digital Circuits 10

You might also like