original data + string of n as are divided by the divisor using binary division and remainder is obtained. The length of predetermined divisor is n+ 1.Ģ. A string of n as is appended to the data unit. The various steps followed in the CRC method areġ.Appending the CRC to the end of the data unit should result in the bit sequence which is exactly divisible by the divisor. It should have exactly one less bit than divisor.Ģ. A sequence of redundant bits called CRC or CRC remainder is appended at the end of a data unit such as byte.Ī CRC will be valid if and only if it satisfies the following requirements:ġ. This technique is more powerful than the parity check and checksum error detection.If remainder after division is not zero, it indicates that the data unit has been damaged in transit and therefore it is rejected.If the remainder after division is zero then there is no error in the data unit & receiver accepts it.data + CRC is divided by the same number (predetermined binary divisor). At the destination, the incoming data unit i.e.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |