Documente Academic
Documente Profesional
Documente Cultură
Parity Checking
primarily for detecting errors when the
number of information bits is small and
the probability of an error being present is
small
Example: In ASCII
A= 1000001
B= 1000010
C= 1000011
Example: In ASCII
A= 1000001
B= 1000010
C= 1000011
Longitudinal
Traverse (Row) (Column)
Parity Bits Parity Bits
Polynomial Codes
0X1 + 1X0
= X 5 + X 4 + X0
= X5 + X4 + 1
Degree of 110001 = 5
(highest exponent)
Polynomial Codes
Examples:
10011011 00110011
+ 11001010 - 11001101
01010001 11111110
Polynomial Codes
Given:
Message Frame M(X) = 1101011011
Generator G(X) = 10011 r = 4 (degree)
M’(X) = 11010110110000
Example:
M’ = 11
G = 5
Remainder of M’ / G = 1
T = 11 -1 = 10 exactly divisible by G
Some Points Regarding
Polynomial Codes
1. CRC - 12
X12 + X11 + X3 + X2 + X + 1
2. CRC - 16
X16 + X15 + X2 + 1
3. CRC - CCITT
X16 + X12 + X5 + 1
4. CRC - 32
X32 + X26 + X23 + X22 + X16 + X12 + X11 + X10 + X8
+ X7 + X5 + X4 + X2 + X + 1
Error Correction Techniques
Example:
11 = 1 + 2 + 8
b1 = 1
b2 = 1
b4 = 0
b8 = 0
b1 b2 b3 b4 b5 b6 b7 b8 b9 b10 b11
1 1 1 0 1 0 1 0 1 0 1
Correcting Errors