DLD Lec 4

Digital Logic Design
By: Fahim Shahzad

BCD Addition
Consider the addition of two decimal digits in BCD, together with a
possible carry from a previous less significant pair of digits.
Since each digit does not exceed 9, the sum cannot be greater than 9 + 9 +
1 = 19, with the 1 being a previous carry.
Suppose we add the BCD digits as if they were binary numbers.
Then the binary sum will produce a result in the range from 0 to 19.
In binary, this range will be from 0000 to 10011, but in BCD, it is from
0000 to 1 1001.
When the binary sum is equal to or less than 1001 (without a carry), the
corresponding BCD digit is correct.
However, when the binary sum is greater than or equal to 1010, the result
is an invalid BCD digit.
The addition of 6 = 0110 to the binary sum converts it to the correct digit
and also produces a carry as required.
BCD Addition Examples
BCD Addition Examples
Error detection codes (Parity bit)
Binary information may be transmitted through some
communication medium, e.g. using wires or wireless media.
A corrupted bit will have its value changed from 0 to 1 or vice
versa.
To be able to detect errors at the receiver end, the sender sends
an extra bit (parity bit) with the original binary message.
A parity bit is an extra bit included with the n-bit binary
message to make the total number of 1’s in this message
(including the parity bit) either odd or even.
If the parity bit makes the total number of 1’s an odd (even)
number, it is called odd (even) parity.
Parity bit
Parity bit
Parity bit
At the receiver end, an error is detected if the message does not
match have the proper parity (odd/even).
Parity bits can detect the occurrence 1, 3, 5 or any odd number
of errors in the transmitted message.
No error is detectable if the transmitted message has 2 bits in
error since the total number of 1’s will remain even (or odd) as
in the original message.
In general, a transmitted message with even number of errors
cannot be detected by the parity bit.
Logic circuits
The two values of binary variables may be equivalently
referred to as 0 and 1 or False (0) and True (1)or as
Low (0) and High(1).
Whether we use 0 and 1 or False and True or Low and
High, all these are referred to as Logic Values.
Systems manipulating Binary Logic Signals are
commonly referred to as Binary Logic systems.
Digital circuits implementing a particular Binary
(Boolean) function are commonly known as Logic
Circuits.
Logic Gates and Logic operations
The AND operation
If X and Y are two binary variables, the result of the
operation X AND Y is 1 if and only if both X = 1 and
Y = 1, and is 0 otherwise.
In Boolean expressions, the AND operation is
represented either by a “dot” or by the absence of an
operator.
Thus, X AND Y is written as X.Y or just XY.
This is summarized in the following table (commonly
called truth table): (Next slide)
The AND operation/ AND gate
The electronic device which performs the AND
operation is called the AND gate.
Figure shows the symbol of a 2-input AND gate
which has two inputs (X and Y) and gives one output
Z=XY
AND gates may have more than 2 inputs.
The truth table of the output variable Z=WXY of the
3-input AND gate is given in Table below.
The output of an AND gate is 1 if and only if ALL its
input signals are 1’s, otherwise it is 0.
A function of two input binary variables will have a
truth table of 4 rows since each variable may assume
any one of two possible values (0 or 1).
A function of three input variables will have a truth
table of 8 rows.
In general, a function of n input variables, will have a
truth table of 2n rows.
The OR operation
If X and Y are two binary variables, the result of the
operation X OR Y is 1 if and only if either X = 1 or Y =
1 or both X & Y are 1’s, but it is 0 otherwise.
In other words, X OR Y is 0 if and only if both X = 0
and Y = 0, but is 1 otherwise.
In general, the output of an OR gate is 1 unless ALL its
input signals are 0’s.
In Boolean expressions, the OR operation is represented
by a “plus” sign.
Thus, X OR Y is written as X+Y
This is summarized in the Table 3.
The OR operation/ OR gate
Three input OR gate
The NOT operation
NOT is a “unary” operator.
If Z = NOT X, then the value of Z will always be the
complement of the value of X.
In other words, if X = 0 then Z = 1, and if X = 1 then Z
=0.
In Boolean expressions, the NOT operation is
represented by either a bar on top of the variable (e.g. Z
= ) or a prime (e.g. Z = X ' ).
The electronic device which performs the NOT
operation is called the NOT gate, or simply
INVERTER.
The NOT operation/ INVERTER
Timing diagram
The timing diagrams illustrate the idealized response of each
gate to the four input signal combinations.
The horizontal axis of the timing diagram represents the time,
and the vertical axis shows the signal as it changes between the
two possible voltage levels.
The low level represents logic 0, the high level logic 1.
Basic theorems of Boolean algebra
Duality Principle
Given a Boolean expression, its
dual is obtained by replacing each
1 with a 0, each 0 with a 1, each
AND (.) with an OR (+), and each
OR (+) with an AND(.).
The dual of an identity is also an
identity. This is known as the
duality principle.
Also
Operator precedence
The precedence rules for various operators are given
below , in a decreasing order of priority:
Example 1
Prove that X + XY = X
Proof:
X + XY = X.(1 + Y) = X.1 = X
Example 2
Prove that X + X`Y = X + Y
Proof:
X + X`Y = (X+ X`) (X + Y)
= 1.(X + Y)
= X + Y
Logic Circuits and expressions
A Boolean expression (or a Boolean function) is a
combination of Boolean variables, AND-operators, OR-
operators, and NOT operators.
Boolean Expressions (Functions) are fully defined by
their truth tables.
Each Boolean function (expression) can be implemented
by a digital logic circuit which consists of logic gates.
Variables of the function correspond to signals in the
logic circuit, Operators of the function are converted into
corresponding logic gates in the logic circuit.
Consider the expression F = X + (Y .Z)
The diagram of the logic circuit corresponding to this
function is shown in Figure:
Consider the expression F = X + (Y .Z)
The truth table for this expression will be:
Thank you.

DLD Lec 4

Uploaded by

Copyright:

Available Formats

DLD Lec 4

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DLD Lec 4

Uploaded by

Copyright:

Available Formats

Digital Logic Design

By: Fahim Shahzad

You might also like

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