Types of Errors
Single-Bit Error
A single-bit error refers to a type of data transmission error that occurs when one bit
(i.e., a single binary digit) of a transmitted data unit is altered during transmission,
resulting in an incorrect or corrupted data unit.
Multiple-Bit Error
A multiple-bit error is an error type that arises when more than one bit in a data transmission is
affected. Although multiple-bit errors are relatively rare when compared to single-bit errors,
they can still occur, particularly in high-noise or high-interference digital environments.
Burst Error
When several consecutive bits are flipped mistakenly in digital transmission, it creates a
burst error. This error causes a sequence of consecutive incorrect values.
Burst Error
To detect errors, a common technique is to introduce redundancy bits that provide additional information. Various
techniques for error detection include::
1. Simple Parity Check
2. Two-dimensional Parity Check
3. Checksum
4. Cyclic Redundancy Check (CRC)
1. Simple Parity Check
Simple-bit parity is a simple error detection method that involves adding an extra bit
to a data transmission. It works as:
•1 is added to the block if it contains an odd number of 1’s, and
•0 is added if it contains an even number of 1’s
This scheme makes the total number of 1’s even, that is why it is called even parity checking.
Two-dimensional Parity Check
Two-dimensional Parity check bits are calculated for each row, which is equivalent to a
simple parity check bit. Parity check bits are also calculated for all columns, then both are
sent along with the data. At the receiving end, these are compared with the parity bits
calculated on the received data.
Checksum
Checksum error detection is a method used to identify errors in transmitted data. The
process involves dividing the data into equally sized segments and using a 1’s complement
to calculate the sum of these segments. The calculated sum is then sent along with the data
to the receiver. At the receiver’s end, the same process is repeated and if all zeroes are
obtained in the sum, it means that the data is correct.
Checksum – Operation at Sender’s Side
•Firstly, the data is divided into k segments each of m bits.
•On the sender’s end, the segments are added using 1’s complement arithmetic to get the
sum. The sum is complemented to get the checksum.
•The checksum segment is sent along with the data segments.
Checksum – Operation at Receiver’s Side
•At the receiver’s end, all received segments are added using 1’s complement arithmetic to
get the sum. The sum is complemented.
•If the result is zero, the received data is accepted; otherwise discarded.
Cyclic Redundancy Check (CRC)
•Unlike the checksum scheme, which is based on addition, CRC is based on binary division.
•In CRC, a sequence of redundant bits, called cyclic redundancy check bits, are appended
to the end of the data unit so that the resulting data unit becomes exactly divisible by a
second, predetermined binary number.
•At the destination, the incoming data unit is divided by the same number. If at this step
there is no remainder, the data unit is assumed to be correct and is therefore accepted.
•A remainder indicates that the data unit has been damaged in transit and therefore must
be rejected.
