ErrorCoding.pptVIP

Error Coding Transmission process may introduce errors into a message. Single bit errors versus burst errors Detection: Requires a convention that some messages are invalid Hence requires extra bits An (n,k) code has codewords of n bits with k data bits and r = (n-k) redundant check bits Correction Forward error correction: many related code words map to the same data word Detect errors and retry transmission Parity 1-bit error detection with parity Add an extra bit to a code to ensure an even (odd) number of 1s Every code word has an even (odd) number of 1s Voting 1-bit error correction with voting Every codeword is transmitted n times Basic Concept:Hamming Distance Hamming distance of two bit strings = number of bit positions in which they differ. If the valid words of a code have minimum Hamming distance D, then D-1 bit errors can be detected. If the valid words of a code have minimum Hamming distance D, then [(D-1)/2] bit errors can be corrected. Examples Parity Digital Error Detection Techniques Two-dimensional parity Detects up to 3-bit errors Good for burst errors IP checksum Simple addition Simple in software Used as backup to CRC Cyclic Redundancy Check (CRC) Powerful mathematics Tricky in software, simple in hardware Used in network adapter Two-Dimensional Parity Use 1-dimensional parity Add one bit to a 7-bit code to ensure an even/odd number of 1s Add 2nd dimension Add an extra byte to frame Bits are set to ensure even/odd number of 1s in that position across all bytes in frame Comments Catches all 1-, 2- and 3-bit and most 4-bit errors Internet Checksum Idea Add up all the words Transmit the sum Internet Checksum Use 1’s complement addition on 16bit codewords Example Codewords: -5 -3 1’s complement binary: 1010 1100 1’s complement sum 1000 Comments Small number of redundant bits Easy to implement Not very robust IP Checksum u_short cksum(u_short *buf, int count) { register u_long sum = 0; while (count--) { sum += *buf++; if (sum 0xFFFF00