Scribd
Upload
6 views

LEC-4

The document discusses parity as an error detection method in digital data transmission, explaining even and odd parity systems. It also covers Boolean algebra principles, including laws, minterms, maxterms, and standard forms like Sum of Products (SOP) and Product of Sums (POS). Additionally, it highlights the importance of canonical forms and simplification techniques in digital design.

Uploaded by

Rafay Owais
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
6 views

LEC-4

The document discusses parity as an error detection method in digital data transmission, explaining even and odd parity systems. It also covers Boolean algebra principles, including laws, minterms, maxterms, and standard forms like Sum of Products (SOP) and Product of Sums (POS). Additionally, it highlights the importance of canonical forms and simplification techniques in digital design.

Uploaded by

Rafay Owais
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 29

0

Digital Design
7 EVEN Vs ODD Parity
A parity is an error coding method to find errors in digital
data. A parity bit is an extra bit which is added in binary
message to make total number of 1's either even or odd.
While reading or receiving the data parity check is made
to find the errors in data. It is used for error detection in
the original data at the receiver side and correcting the
data. Parity word denotes the number of 1's in binary
string. There are two parity systems: even or odd.
Even parity and odd parity are two methods which are
used in data transmission to ensure the integrity of
transmitted data. Both methods involve adding an extra
bit to the data being transmitted, which is called parity
bit, which is used for error detection.
Even Parity Check?

In even parity check works by ensuring that the


total number of ones in the data, including parity
bit is even. If in any case the total number of 1 in
the data bit is odd then a single 1 will be added to
make total number of 1 even else 0 will be
appended (if total number of 1 are already even).
Hence, if any error occurs, the parity check circuit
will detect it at the receiver’s end.
Odd Parity Check?
Odd parity, on the other hand, functions
similarly but ensures that the total
number of ones in the data, including the
parity bit, is odd. If total number of 1 in
the given binary string are even then 1 is
appended to make the total count of 1 as
odd else 0 is appended.
What is even parity and how
does it work in data
transmission?
Even parity is a method that is used in data
transmission to ensure data integrity. It consist
of adding an extra bit, called a parity bit, to the
transmitted data. This parity bit is set to 1 or 0
in a way that the total number of ones in the
data, including the parity bit, becomes even. If
the data already contains an even number of
ones then the parity bit is set to 0. If the data
has an odd number of ones then the parity bit
is set to 1. This process allows for the
detection of errors during transmission.
What is odd parity and its
role in ensuring data
integrity?

Odd parity is another method used for error detection in data


transmission. Similar to even parity, it involves adding a
parity bit to the transmitted data. In odd parity the parity bit
is set to 1 or 0 in a way that the total number of ones in the
data including the parity bit becomes odd. If the data already
has an odd number of ones thaen the parity bit is set to 0. If
the data has an even number of ones then the parity bit is set
to 1. This process helps in detecting errors during
transmission.
Laws, Rules & Theorems of
Boolean Algebra

🠶 Closure
🠶 Commutative
Law
🠶 Identity
Element
🠶 Inverse
🠶 Distributive
Law
Commutative
Law
🠶 Commutative Law for
Addition A + B = B + A

🠶 Commutative Law for


Multiplication
A.B = B.A
Distributive
Law
A.(B + C) = A.B
+ A.C
Simplify Boolean
Functions
Minterms and
Maxterms & Binary
representations
A B C Min-terms Max-
terms
0 0 0 A.B.C ABC

0 0 1 A.B.C ABC
0 1 0 A.B.C ABC
0 1 1 A.B.C ABC
1 0 0 A.B.C ABC
1 0 1 A.B.C A  B  C
1 1 0 A.B.C A  B  C
1 1 1 A.B.C A  B  C
Canonical Forms
Boolean functions expressed as a sum of minterms or
product of maxterms are said to be in canonical form.
It is useful to specify Boolean functions in a form that:
Allows comparison for equality.
Has a correspondence to the truth tables
Canonical Forms in common usage:
Sum of Minterms (SOM)
Product of Maxterms (POM)
Minterms
Minterms are AND terms with every variable present in
either true or complemented form.
Given that each binary variable may appear normal (e.g., x)
or complemented (e.g., x’), there are 2n minterms for n
variables.
Min term always produce output as 1.
Example: Two variables (X and Y)produce
2 x 2 = 4 combinations:
X Y (both normal)
X Y’ (X normal, Y complemented)
X’ Y (X complemented, Y normal)
X’ Y’ (both complemented)
Thus there are four minterms of two variables.
Minterms
Sum of minterm

f 1=
Minterm Function Example
Example: Find F1(X,Y,Z) = m1 + m4 + m7
F1 = x’ y’ z + x y’ z’ + x y z

xyz index m1 + m4 + m7 = F1
000 0 0 + 0 + 0 =0
001 1 1 + 0 + 0 =1
010 2 0 + 0 + 0 =0
011 3 0 + 0 + 0 =0
100 4 0 + 1 + 0 =1
101 5 0 + 0 + 0 =0
110 6 0 + 0 + 0 =0
111 7 0 + 0 + 1 =1
Maxterms

Maxterms are OR terms with every variable in true or complemented form.


Given that each binary variable may appear normal (e.g., x’) or complemented (e.g., x), there
are 2n maxterms for n variables.
Example: Two variables (X and Y) produce
2 x 2 = 4 combinations:
(both normal)
(x normal, y complemented)
(x complemented, y normal)
(both complemented)
X +Y
X +Y
X +Y
X +Y
Maxterms
Sum of maxterm
Standard forms of
Boolean functions
 Sum of Products (SOP)
 The logical sum of two or more logical product terms is
referred to as a sum of products expression.
 For example, Y = AB + BC + AC or Y = A′B + BC + AC′ are
sum of products expressions.
 Product of Sums (POS)
 Similarly, the logical product of two or more logical sum
terms is called a product of sums expression.
 For example, Y = (A + B + C)(A + B′ + C)(A + B + C′) or Y =
(A + B + C)(A′ + B′ + C′) are product of sums expressions.
Why Standard SOP and POS
forms?
• Any logic circuit can be implemented by using either the
SOP, AND-OR combination of gates or POS, OR-AND
combination of gates.
• It is very simple to convert from standard SOP to standard
POS or vice versa. This helps in selecting an
implementation that requires the minimum number of
gates.
• Secondly, the simplification of general Boolean expression
by applying the laws, rules and theorems does not always
result in the simplest form as the ability to apply all the
rules depends on ones experience and knowledge of all
the rules.
Why Standard SOP and POS
forms?
• A simpler mapping method uses Karnaugh maps to
simplify general expressions. Mapping of all the terms
in a SOP form expression and the sum terms in a POS
form can be easily done if standard forms of SOP and
POS expressions are used.

• Lastly, the PLDs are implemented having a general


purpose structure based on AND-OR arrays. A function
represented by an expression in Standard SOP form can
be readily programmed.
Converting in SoP Standard
form example
let F = A + B’C
A = A(B + B‘ ) = AB + AB‘
This function is still missing one variable, so
Standard Products-of-
Sum (POS)

You might also like