0% found this document useful (0 votes)
40 views31 pages

Lectrure 2

This document discusses digital logic concepts including logic gates, truth tables, Boolean algebra, Karnaugh maps, and combinational logic circuits. It provides examples of designing combinational logic circuits using a step-by-step process involving truth tables and Boolean expressions. Common logic gates and their functions are defined. Methods for analyzing and simplifying Boolean expressions including Karnaugh maps are described.

Uploaded by

Wilson Bethuel
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% found this document useful (0 votes)
40 views31 pages

Lectrure 2

This document discusses digital logic concepts including logic gates, truth tables, Boolean algebra, Karnaugh maps, and combinational logic circuits. It provides examples of designing combinational logic circuits using a step-by-step process involving truth tables and Boolean expressions. Common logic gates and their functions are defined. Methods for analyzing and simplifying Boolean expressions including Karnaugh maps are described.

Uploaded by

Wilson Bethuel
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/ 31

Digital logic

Logic gates are the basic building blocks of digital electronic circuits.
These elements perform logical operations on one or more input signals to
produce a single output signal.
There are several types of logic junction elements, including:
AND gate: This gate produces a high output only if all its inputs are high.
NOT gate: This gate produces an output that is the opposite of its input.
NAND gate: This gate is a combination of an AND gate and a NOT
gate, producing a low output only if all its inputs are high.
NOR gate: This gate is a combination of an OR gate and a NOT gate,
producing a high output only if all its inputs are low.
XOR gate: This gate produces a high output if its inputs are different,
and a low output if they are the same.
These logic junction elements can be combined in various ways to create
more complex logic circuits.
Combinational Logic

Determine signal expressions and values in a logic diagram


BOOLEAN ALGEBRA

In formulating mathematical expressions for logic circuits, it is important to


have knowledge of Boolean algebra, which defines the rules for
expressing and simplifying binary logic statements.
The basic Boolean laws and identities follow.
A bar over a symbol indicates the Boolean operation NOT, which
corresponds to inversion of a signal.
KARNAUGH MAP AND ITS USES
It provides the systematic way for simplification of Boolean expression.
It produce the simplest sum of product or product of sum

Consider A, B, C, and D are the 4 Boolean input variables


Two inputs single output
Y 1 = AB + AB
Three inputs single output
Y 2 = ABC + ABC + ABC
Four inputs single output
Y 3 = ABCD + ABCD + ABCD + ABCD
Y 2 = ABC + ABC + ABC C C
B B
AB
A 1
A 1 AB 1
Y 2 = AB + BC
AB 1 1
Y 1 = AB + AB Y1 = B
AB
CD CD Y 2 = AB + ABC
CD CD
AB Y 3 = ABCD + ABCD + ABCD + ABCD
AB 1 1
AB
AB 1 1 Y 3 = ABD + ABD
Y 2 = ABC + ABC + ABC C C
B B
AB
A 1
A 1 AB 1
Y 2 = AB + BC
AB 1 1
Y 1 = AB + AB Y1 = B
AB
CD CD Y 2 = AB + ABC
CD CD
AB Y 4 = ABCD + ABCD + ABCD + ABCD
AB 1 1
AB
AB 1 1 Y 4 = ???/
Write the simplified Boolean expression presented in the truth table using
Karnaugh map

A B C Y C C
0 0 0 1 AB 1
0 0 1 0 AB
0 1 0 0 AB 1 1
0 1 1 0
AB 1
1 0 0 1
1 0 1 0 Y = AB + BC

1 1 0 1
1 1 1 1
Simplify the following expression using Boolean laws and
identities:
Y = ABC + BC + AB

Simplify the Boolean logic using Karnaugh map


Y = ABCD + ABCD + ABC D + ABC D

Given Boolean equation

( ( )) (
Y = AB + B + A C + BC + BC )
Digital logic problem
Complete Design Procedure
Any logic problem can be solved using the following step-by-step
procedure.
1. Interpret the problem and set up a truth table to describe its operation.
2. Write the AND (product) term for each case where the output is 1.
3. Write the sum-of-products (SOP) expression for the output.
4. Simplify the output expression if possible.
5. Implement the circuit for the final, simplified expression.
Design a logic circuit that has three inputs, A, B, and C, and whose
output will be HIGH only when a majority of the inputs are HIGH.

Step 1. Set up the Step 2. Write the AND term for each case
truth table where the output is a 1
Design a logic circuit that has three inputs, A, B, and C, and whose
output will be HIGH only when a majority of the inputs are HIGH.

Step 1. Set up the Step 2. Write the AND term for each case
truth table where the output is a 1
Design a logic circuit that has three inputs, A, B, and C, and whose output will
be HIGH only when a majority of the inputs are HIGH.

Step 2. Write the AND term for each case


where the output is a 1
Step 3. Write the sum-of-products
expression for the output.

Step 4. Simplify the output expression


Design a logic circuit that has three inputs, A, B, and C, and whose output will
be HIGH only when a majority of the inputs are HIGH.

Step 5. Implement the circuit for the final


Step 3. Write the sum-of-products expression
expression for the output.

Step 4. Simplify the output expression


Figure is an analog-to-digital converter is monitoring the dc voltage (VB) of
a 12-V storage battery on an orbiting spaceship. The converter’s output is a
four-bit binary number, ABCD, corresponding to the battery voltage in
steps of 1 V, with A as the MSB. The converter’s binary outputs are fed to a
logic circuit that is to produce a HIGH output as long as the binary value is
greater than 01102 = 610; that is, the battery voltage is greater than 6 V.
Design this logic circuit.
Step 1. Set up the truth table Step 2. Write the AND term for each case where the output is a 1
Step 2. Write the AND
term for each case where
the output is a 1
Step 3. Write the sum-of-products expression
for the output.

Step 4. Simplify the output expression


Refer to Figure . In a simple copy machine, a stop signal, S, is to be generated
to stop the machine operation and energize an indicator light whenever either
of the following conditions exists: (1) there is no paper in the paper feeder
tray; or (2) the two microswitches in the paper path are activated, indicating a
jam in the paper path. The presence of paper in the feeder tray is indicated by
a HIGH at logic signal P. Each of the microswitches produces a logic signal
(Q and R) that goes HIGH whenever paper is passing over the switch to
activate it. Design the logic circuit to produce a HIGH at output signal S for
the stated conditions, and implement it using the 74HC00 CMOS
quad two-input NAND chip.
Step 1. Set up the Step 2. Write the AND term for each case
truth table where the output is a 1
Step 2. Write the AND term for Step 3. Write the sum-of-products expression
each case where the output is a 1 for the output.

Step 4. Simplify the output expression


Step 5. The AND/OR
implementation for this circuit To implement this circuit using the
74HC00 quad two-input NAND chip
1. Write the sum-of-products expression for a circuit with four inputs
and an output that is to be HIGH only when input A is LOW at the
same time that exactly two other inputs are LOW.
2. Implement the expression of question 1 using all four-input NAND
gates. How many are required?
3. List the steps of the systematic design process
Design a logic circuit whose output is HIGH whenever A and B are
both HIGH as long as C and D are either both HIGH or both LOW

Construct logic circuits that produce following outputs:


Q = ( x + y) x

(
Q2 = y + z x) Q3 = ( x + y + z ) x y z
Steps required for writing basic program
1)Make a truth table for given conditions.
2)Go to the first output and take a coil for it. Don’t think
about all outputs in your truth table. For some examples,
we shall start with coil.
3)Check the true conditions of output and add the status
of inputs.
4)For input 1 take NO and for input 0 take NC.
5)Do not make program for 0 (zero) of output
STEPS required for making XOR program
1) Make a truth table. 1
Sn A B Q0
0 0 0 0
1 0 1 1
2 1 0 1
3 1 1 0
2) Go to the first output and take a coil for it.
2
Sn A B Q0
0 0 0 0
1 0 1 1
2 1 0 1
3 1 1 0
STEPS required for making XOR program
3)Check the true conditions of output and add the status of inputs.
Sn A B Q0
0 0 0 0
1 0 1 1
3 2 1 0 1
3 1 1 0

4) For input 1 take NO and for input 0 take NC.


Write Boolean expression
1)For HIGH STATE input use.
AB = Q
4
2) For LOW STATE input use. AB = Q
AB + AB = Q
STEPS required for making XOR program
5) Do not make program for 0 (zero) of output

Sn A B Q0
0 0 0 0 x Do not make program for 0
1 0 1 1
2 1 0 1
3 1 1 0 x Do not make program for 0

6) Write Boolean expression if possible simplify


AB = Q
AB = Q
AB + AB = Q
Implement a ladder logic with 3 inputs I0, I1, I2 and one output
Q0. Press any two switches to get Q0 on.

There are two switches I0 and I1. There are 3 outputs Q0, Q1, and
Q2 (blue, green and red lamps). when I0 is pressed green lamp (Q1)
should get on. When I1 is pressed blue and green both lamps (Q0
and Q1) should get on. When I0 and I1 both switches are pressed
only Red lamp (Q2) should get on.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy