Scribd
Upload
32 views44 pages

Presesntation 5 Digital Logic

Here is the solution for quiz question 1: 1) Boolean expression: F = A'B + AB' 2) Truth table: A B F 0 0 0 0 1 1 1 0 1 1 1 0 3) Logic circuit diagram: [Draws the logic circuit diagram that implements the Boolean expression F = A'B + AB']

Uploaded by

wabdushukur
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
32 views44 pages

Presesntation 5 Digital Logic

Here is the solution for quiz question 1: 1) Boolean expression: F = A'B + AB' 2) Truth table: A B F 0 0 0 0 1 1 1 0 1 1 1 0 3) Logic circuit diagram: [Draws the logic circuit diagram that implements the Boolean expression F = A'B + AB']

Uploaded by

wabdushukur
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/ 44

5

Digital logic
Introduction
BINARY SYSTEMS ;
Analog Vs Digital
Digital System
Binary numbers
Number base conversions
Cont.
ANALOG Vs DIGITAL: It is necessary to differentiate between analog and digital. The
following are fews that differentiate between analog and digital.
 Analog information is made up of a continuum of values within a given range

 At its most basic, digital information can assume only one of two possible values:
one/zero, on/off, high/low, true/false, etc.
 Digital Information is less susceptible to noise than analog information
Digital
Digital ; means electronic technology that generates, stores, and processes data in terms of
two states: positive and non-positive. Positive is expressed or represented by the number 1
and non-positive by the number 0.

A ‘‘digital system’’ is a data technology that uses discrete (discontinuous) values


represented by high and low states known as bits. By contrast, non-digital (or analog)
systems use a continuous range of values to represent information.

Binary ; describes a numbering scheme in which there are only two possible values for
each digit: 0 and 1. The term also refers to any digital encoding / decoding system in which
there are exactly two possible states. In digital data memory, storage, processing, and
communications, the 0 and 1 values are sometimes called "low" and "high," respectively.
Cont.
BINARY NUMBER/BINARY NUMBER SYSTEM

The binary number system is a numbering system that represents numeric values using
two unique digits (0 and 1). Most of the computing devices use binary numbering to
represent electronic circuit voltage state, (i.e., on/off switch), which considers 0 voltage
input as off and 1 input as on.

This is also known as the base-2 number system (The base-2 system is a positional
notation with a radix of 2), or the binary numbering system.

10, 111, 10101, 11101


Digital Logic
Many control systems are concerned with setting events in motion or stopping them when
certain conditions are met. For example, with the domestic washing machine, the heater
is only switched on when there is water in the drum and it is to the prescribed level.

Such control involves digital signals where there are only two possible signal levels.
Digital circuitry is the basis of digital computers and microprocessor controlled systems.

 With digital control we might, for example, have the water input to the domestic
washing machine switched on if we have both the door to the machine closed and
a particular time in the operating cycle has been reached.
Cont.
• The controller is here programmed to only give a yes output if both the input signals are
yes, i.e. if input A and input B are both 1 then there is an output of 1. Such an operation
is said to be controlled by a logic gate, in this example an AND gate.
Logic gates
AND OR
gate gate

NOT NAND
gate gate

NOR XOR
gate gate
AND gate
Suppose we have a gate giving a high output only when both input A and input B are
high; for all other conditions it gives a low output. This is an AND logic gate. We can
visualize the AND gate as an electric circuit involving two switches in series as showed in
the figure below.

 The Boolean equation for the AND gate is written as;


OR gate
An OR gate with inputs A and B gives an output of a 1 when A or B is 1. We can
visualize such a gate as an electric circuit involving two switches in parallel (see the
figure). When switch A or B is closed, then there is a current. OR gates can also have
more than two inputs.

We can write the Boolean equation for an OR gate as


NOT gate
A NOT gate has just one input and one output, giving a 1 output when the input is 0 and a
0 output when the input is 1. The NOT gate gives an output which is the inversion of the
input and is called an inverter.

The Boolean equation describing the NOT gate is


NAND gate
The NAND gate can be considered as a combination of an AND gate followed by a NOT
gate Thus when input A is 1 and input B is 1, there is an output of 0, all other inputs
giving an output of 1.

The NAND gate is just the AND gate truth table with the outputs inverted. An alternative
way of considering the gate is as an AND gate with a NOT gate applied to invert both the
inputs before they reach the AND gate.

The Boolean equation describing the NAND gate is


NOR gate
The NOR gate can be considered as a combination of an OR gate followed by a NOT
gate. Thus when input A or input B is 1 there is an output of 0. It is just the OR gate with
the outputs inverted.

An alternative way of considering the gate is as an OR gate with a NOT gate applied to
invert both the inputs before they reach the OR gate.

The Boolean equation for the NOR gate is


XOR gate
The EXCLUSIVE-OR gate (XOR) can be considered to be an OR gate with a NOT gate
applied to one of the inputs to invert it before the inputs reach the OR gate.

Alternatively it can be considered as an AND gate with a NOT gate applied to one of the
inputs to invert it before the inputs reach the AND gate.
Combining gates
It might seem that to make logic systems we require a range of gates. However, as the
following shows, we can make up all the gates from just one. Consider the combination of
three NOR gates shown in Figure.
Cont.
The truth table
Three NAND gates

The truth table


Combinational Logic
• Combinational logic devices are digital devices that convert binary inputs into binary
outputs based on the rules of mathematical logic. The basic operations, schematic
symbols, and algebraic expressions for combinational logic devices are shown in the table
below.
Cont.
All the gates in the above table are manufactured as integrated circuits where transistors,
resistors, and diodes exist on a single chip of silicon.

There are two families of digital integrated circuits: TTL (transistor-transistor logic) and
CMOS (complementary metal-oxide semiconductors). Specific voltage ranges define
logic low (0) and logic high (1) at the inputs and outputs.

This example illustrates how to determine signal expressions and values in a logic
diagram. Here is an example logic circuit:
Cont.
 Signals A, B, and C are inputs and signals D, E, and F are outputs. Each of the signals
can be high (1) or low (0).
Cont.
Boolean Algebra Laws and Identities
Fundamental Laws

Commutative Laws
Cont.
Associative Laws

Distributive Laws

Other Useful Identities


Cont.
TIMING DIAGRAMS
In order to analyze complex logic circuits it helps to sketch a timing diagram, which
shows the simultaneous levels of the inputs and outputs in a circuit vs. time.

The timing diagram can be used to illustrate every possible combination of input values
and corresponding outputs, providing a graphical summary of the input/output
relationships.

Multiple-input digital oscilloscopes and logic analyzers have the capability to display
timing diagrams for digital circuits.

The timing diagram for the logic gates are demonstrated below for each types of
fundamental gates.
Exercise
Quiz 1
1. Determine a simplified Boolean expression for the following circuit
and develop the truth table for the logic circuit below:
Quiz 1

Q #1. Construct the truth table for the


equation , and develop the logic circuit
diagram representation of the above
Boolean expression?

You might also like