0% found this document useful (0 votes)
7 views

Error Detection Codes The Binary I

Uploaded by

raroy67751
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views

Error Detection Codes The Binary I

Uploaded by

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

Error Detection Codes : The binary information is transferred from one location to

another location through some communication medium. The external noise can change
bits from 1 to 0 or 0 to 1.This changes in values changes the meaning of actual
message and is called error. For efficient data transfer, there should be an error
detection and correction codes. An error detection code is a binary code that
detects digital errors during transmission. To detect error in the received
message, we add some extra bits to the actual data.

Without addition of redundant bits, it is not possible to detect errors in the


received message. There are 3 ways in which we can detect errors in the received
message :

1. Parity Bit

2. CheckSum

3. Cyclic Redundancy Check (CRC)

We’ll be understanding the parity bit method in this article in depth :-

Parity Bit Method : A parity bit is an extra bit included in binary message to make
total number of 1’s either odd or even. Parity word denotes number of 1’s in a
binary string. There are two parity system – even and odd parity checks.

1. Even Parity Check: Total number of 1’s in the given data bit should be even. So
if the total number of 1’s in the data bit is odd then a single 1 will be appended
to make total number of 1’s even else 0 will be appended(if total number of 1’s
are already even). Hence, if any error occurs, the parity check circuit will detect
it at the receiver’s end. Let’s understand this with example, see the below diagram
:

Even Parity Check (fig – 1.1)

In the above image, as we can see the data bits are ‘1011000’ and since this is
even parity check that we’re talking about, 1 will be appended as the parity bit
(highlighted in red) to make total count of 1’s even in the data sent. So here, our
parity bit is 1. If the total count of 1 in the given data bits were already even,
then 0 would’ve been appended.

You might also like