





Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
about correction errors related to computer correction
Typology: Lecture notes
1 / 9
This page cannot be seen from the preview
Don't miss anything!






We offer you a brighter future with FREE online courses Start Now!! An error occurs when the output information does not match the input information. Digital signals suffer from noise during transmission, which can create errors in binary bits travelling from one system to another. That is, a 0 bit may become a 1 bit, or a 1 bit may become a 0. Many factors, including noise and cross-talk, can contribute to data corruption during transmission. The top layers are unaware of real hardware data processing and work on a generic picture of network architecture. As a result, the top levels anticipate error-free transmission between the systems. Most programs would not work normally if they received incorrect data. Voice and video applications, for example, may be unaffected and continue to work normally despite occasional problems.
When a message is sent, it may be jumbled by noise or the data may be damaged. To avoid this, we employ error-detecting codes, which are bits of extra data appended to a digital message to assist us detect whether an error occurred during transmission.
If the result is 0, the data is accepted; otherwise, it is rejected.
The receiver, on the other hand, divides the codewords using the same CRC divisor. If the remainder consists entirely of zeros, the data bits are validated; otherwise, it is assumed that some data corruption happened during transmission. Error Correction: Error Correction codes are used to detect and repair mistakes that occur during data transmission from the transmitter to the receiver. There are two approaches to error correction:
Number of data bits = 7 Thus, number of redundancy bits = 4 Total bits = 7+4 = 11 Redundant bits are always placed at positions that correspond to the power of 2, so the redundant bits will be placed at positions: 1,2,4 and 8. Redundant bits will be placed here: Thus now, all the 11 bits will look like this: Here, R1, R2, R4 and R8 are the redundant bits. Determining the parity bits: R1:
We look at bits 1,3,5,7,9,11 to calculate R1. In this case, because the number of 1s in these bits together is even, we make the R1 bit equal to 0 to maintain even parity. R2: We look at bits 2,3,6,7,10,11 to calculate R2. In this case, because the number of 1s in these bits together is odd, we make the R2 bit equal to 1 to maintain even parity. R4: