parity bit is 1: data should have an odd number of 1's

Slides:



Advertisements
Similar presentations
I/O Errors 1 Computer Organization II © McQuain RAID Redundant Array of Inexpensive (Independent) Disks – Use multiple smaller disks (c.f.
Advertisements

Noise, Information Theory, and Entropy (cont.) CS414 – Spring 2007 By Karrie Karahalios, Roger Cheng, Brian Bailey.
Hamming Code.
Cyclic Code.
Applied Algorithmics - week7
Error Control Code.
ERROR CORRECTION.
NETWORKING CONCEPTS. ERROR DETECTION Error occures when a bit is altered between transmission& reception ie. Binary 1 is transmitted but received is binary.
Chapter 10 Error Detection and Correction
Quantum Error Correction SOURCES: Michele Mosca Daniel Gottesman Richard Spillman Andrew Landahl.
Error Detection / Correction
Error detection and correction
MAT 1000 Mathematics in Today's World Winter 2015.
Unit 1 Protocols Learning Objectives: Understand the need to detect and correct errors in data transmission.
15-853Page :Algorithms in the Real World Error Correcting Codes I – Overview – Hamming Codes – Linear Codes.
Error Detection and Reliable Transmission EECS 122: Lecture 24 Department of Electrical Engineering and Computer Sciences University of California Berkeley.
Error Detection and Correction Rizwan Rehman Centre for Computer Studies Dibrugarh University.
Stuart Hansen University of Wisconsin - Parkside.
Hamming Code Rachel Ah Chuen. Basic concepts Networks must be able to transfer data from one device to another with complete accuracy. Data can be corrupted.
Hamming Code A Hamming code is a linear error-correcting code named after its inventor, Richard Hamming. Hamming codes can detect up to two bit errors,
exercise in the previous class (1)
Shashank Srivastava Motilal Nehru National Institute Of Technology, Allahabad Error Detection and Correction : Data Link Layer.
Error Detection and Correction
Information Coding in noisy channel error protection:-- improve tolerance of errors error detection: --- indicate occurrence of errors. Source.
PART III DATA LINK LAYER. Position of the Data-Link Layer.
Error Control Code. Widely used in many areas, like communications, DVD, data storage… In communications, because of noise, you can never be sure that.
Memory Intro Computer Organization 1 Computer Science Dept Va Tech March 2006 ©2006 McQuain & Ribbens Built using D flip-flops: 4-Bit Register Clock input.
MIMO continued and Error Correction Code. 2 by 2 MIMO Now consider we have two transmitting antennas and two receiving antennas. A simple scheme called.
Data and Computer Communications by William Stallings Eighth Edition Digital Data Communications Techniques Digital Data Communications Techniques Click.
ENEE244-02xx Digital Logic Design Lecture 3. Announcements Homework 1 due next class (Thursday, September 11) First recitation quiz will be next Monday,
Practical Session 10 Error Detecting and Correcting Codes.
Introduction to Coding Theory. p2. Outline [1] Introduction [2] Basic assumptions [3] Correcting and detecting error patterns [4] Information rate [5]
Error Control Code. Widely used in many areas, like communications, DVD, data storage… In communications, because of noise, you can never be sure that.
Data Integrity © Prof. Aiman Hanna Department of Computer Science Concordia University Montreal, Canada.
Overview All data can be corrupted, for reliable communications we must be able to detect and correct errors implemented at the data link and transport.
Error Detection and Correction
VLSI AND INTELLIGENT SYTEMS LABORATORY 12 Bit Hamming Code Error Detector/Corrector December 2nd, 2003 Department of Electrical and Computer Engineering.
Computer Communication & Networks Lecture 9 Datalink Layer: Error Detection Waleed Ejaz
ERROR DETECTING AND CORRECTING CODES -BY R.W. HAMMING PRESENTED BY- BALAKRISHNA DHARMANA.
CHAPTER 3: DATA LINK CONTROL Flow control, Error detection – two dimensional parity checks, Internet checksum, CRC, Error control, Transmission efficiency.
1 © Unitec New Zealand CRC calculation and Hammings code.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Data Communications and Networking
Error-Detecting and Error-Correcting Codes
Hamming Distance & Hamming Code
Computer Architecture Error Correcting Codes Ralph Grishman Oct (Text pp and B-65-67) NYU.
1 Product Codes An extension of the concept of parity to a large number of words of data 0110… … … … … … …101.
Hamming (4,7) Code Binary Linear Codes Hamming Distance Weight of BLC
Error Detecting and Error Correcting Codes
Practical Session 10 Computer Architecture and Assembly Language.
Hamming Codes The Hamming Code is a Forward Error-correcting Code (FEC) that uses redundant bits to correct a single bit error For 4 bit codes, 3 redundant.
parity bit is 1: data should have an odd number of 1's
Computer Architecture and Assembly Language
: An Introduction to Computer Networks
Error Correcting Code.
CIS 321 Data Communications & Networking
Representing characters
Even/odd parity (1) Computers can sometimes make errors when they transmit data. Even/odd parity: is basic method for detecting if an odd number of bits.
Coding Theory Dan Siewiorek June 2012.

Information Redundancy Fault Tolerant Computing
DATA COMMUNICATION Lecture-35.
RAID Redundant Array of Inexpensive (Independent) Disks
Fundamentals of Data Representation
Error Detection and Correction
CS 325: CS Hardware and Software Organization and Architecture
Computer Architecture and Assembly Language
parity bit is 1: data should have an odd number of 1's
Error Detection and Correction
4-Bit Register Built using D flip-flops:
Presentation transcript:

parity bit is 1: data should have an odd number of 1's Error Detection Error detecting codes enable the detection of errors in data, but do not determine the precise location of the error. - store a few extra state bits per data word to indicate a necessary condition for the data to be correct - if data state does not conform to the state bits, then something is wrong - e.g., represent the correct parity (# of 1’s) of the data word - 1-bit parity codes fail if 2 bits are wrong… 1011 1101 0001 0000 1101 0000 1111 0010 1 parity bit is 1: data should have an odd number of 1's A 1-bit parity code is a distance-2 code, in the sense that at least 2 bits must be changed (among the data and parity bits) produce an incorrect but legal pattern. In other words, any two legal patterns are separated by a distance of at least 2.

Parity Bits Two common schemes (for single parity bits): - even parity 0 parity bit if data contains an even number of 1's - odd parity 0 parity bit if data contains an odd number of 1's We will apply an even-parity scheme. 1011 1101 0001 0000 1101 0000 1111 0010 1 The parity bit could be stored at any fixed location with respect to the corresponding data bits. Upon receipt of data and parity bit(s), a check is made to see whether or not they correspond. Cannot detect errors involving two bit-flips (or any even number of bit-flips).

Hamming (7,4) Code Richard Hamming (1950) described a method for generating minimum-length error-detecting codes. Here is the (7,4) Hamming code for 4-bit words: Data bits d4d3d2d1 Parity bits P3p2p1 0000 000 0001 011 0010 101 0011 110 0100 0101 0110 0111 1000 111 1001 100 1010 010 1011 001 1100 1101 1110 1111 Say we receive the data word 0100 and parity bits 011. Those do not match (see the table). Therefore, we know an error has occurred. But where?

Hamming (7,4) Code Suppose the parity bits are correct (011) and the data bits (0100) contain an error: Data bits d4d3d2d1 Parity bits p3p2p1 0000 000 0001 011 0010 101 0011 110 0100 0101 0110 0111 1000 111 1001 100 1010 010 1011 001 1100 1101 1110 1111 The received parity bits 011 suggest the data bits should have been 0001 or 0110. The first case would mean two data bits flipped. The second would mean that one data bit flipped.

Hamming (7,4) Code Suppose the data bits (0100) are correct and the parity bits (011) contain an error: Data bits d4d3d2d1 Parity bits p3p2p1 0000 000 0001 011 0010 101 0011 110 0100 0101 0110 0111 1000 111 1001 100 1010 010 1011 001 1100 1101 1110 1111 The received data bits 0100 would match parity bits 110. That would mean two parity bits flipped. If we assume that only one bit flipped, we can conclude the correction is that the data bits should have been 0110. If we assume that two bits flipped, we have two equally likely candidates for a correction, and no way to determine which would have been the correct choice.

Hamming (7,4) Code Details Hamming codes use extra parity bits, each reflecting the correct parity for a different subset of the bits of the code word. Parity bits are stored in positions corresponding to powers of 2 (positions 1, 2, 4, 8, etc.). The encoded data bits are stored in the remaining positions. Data bits: 1011 d4d3d2d1 Hamming encoding: b7 b6 b5 b4 b3 b2 b1 101?1?? d4 d3 d2 p3 d1 p2 p1 Parity bits: 010 p3p2p1

Hamming Code Details But, how are the parity bits defined? - p1: all higher bit positions k where the 20 bit is set (1) - p2: all higher bit positions k where the 21 bit is set … - pn: all higher bit positions k where the 2n bit is set Hamming encoding: b111 b110 b101 b100 b11 b10 b1 101?1?? d4 d3 d2 p3 d1 p2 p1 This means that each data bit is used to define at least two different parity bits; that redundancy turns out to be valuable.

Hamming (7,4) Code Details So, for our example: Hamming encoding: b111 b110 b101 b100 b11 b10 b1 101?1?? 1 0 1 p3 1 p2 p1 2 ones: p2 == 0 3 ones: p1 == 1 2 ones: p3 == 0 So the Hamming encoding would be : 1010101

Error Correction A distance-3 code, like the Hamming (7,4) allows us two choices. We can use it to reliably determine an error has occurred if no more than 2 received bits have flipped, but not be able to distinguish a 1-bit flip from a 2-bit flip. We can use to determine a correction, under the assumption that no more than one received bit is incorrect. We would like to be able to do better than this. That requires using more parity bits. The Hamming (8,4) allows us to distinguish 1-bit errors from 2-bit errors. Therefore, it allows to reliably correct errors that involve single bit flips. The Hamming Code pattern defined earlier can be extended to data of any width, and with some modifications, to support correction of single bit errors.

Hamming (11,7) Code Suppose have a 7-bit data word and use 4 Hamming parity bits: 0001 P1 : depends on D1, D2, D4, D5 0010 P2 : depends on D1, D3, D4, D6 0011 D1 0100 P3 : depends on D2, D3, D4, D7 0101 D2 0110 D3 0111 D4 1000 P4 : depends on D5, D6, D7 1001 D5 1010 D6 1100 D7 Note that each data bit, Dk, is involved in the definition of at least to parity bits. And, note that no parity bit checks any other parity bit.

Hamming (11,7) Code Suppose have a 7-bit data word and use 4 Hamming parity bits: P1 : depends on D1, D2, D4, D5 P2 : depends on D1, D3, D4, D6 P3 : depends on D2, D3, D4, D7 P4 : depends on D5, D6, D7 Note that each data bit, Dk, is involved in the definition of at least to parity bits. And, note that no parity bit checks any other parity bit.

Hamming (11,7) Code Suppose that a 7-bit value is received and that one data bit, say D4, has flipped and all others are correct. P1 : depends on D1, D2, D4, D5 P2 : depends on D1, D3, D4, D6 P3 : depends on D2, D3, D4, D7 P4 : depends on D5, D6, D7 Then D4 being wrong will cause three parity bits to not match the data: P1 P2 P3 So, we know there’s an error… And, assuming only one bit is involved, we know it must be D4 because that’s the only bit involved in all three of the nonmatching parity bits. And, notice that: 0001 | 0010 | 0100 == 0111 binary indices of the incorrect parity bits binary index of the bit to be corrected QTP: what if the flipped data bit were D3?

Hamming (11,7) Code What if a single parity bit, say P3, flips?. P1 : depends on D1, D2, D4, D5, D7 P2 : depends on D1, D3, D4, D6, D7 P3 : depends on D2, D3, D4 P4 : depends on D5, D6, D7 What if a single parity bit, say P3, flips?. Then the other parity bits will all still match the data: P1 P2 P4 So, we know there’s an error… And, assuming only one bit is involved, we know it must be P3 because if any single data bit had flipped, at least two parity bits would have been affected.

Why (11,7) is a Poor Fit Standard data representations do not map nicely into 11-bit chunks. More precisely, a 7-bit data chunk is inconvenient. If we accommodate data chunks that are some number of bytes, and manage the parity bits so that they fit nicely into byte-sized chunks, we can handle the data + parity more efficiently. For example: (12,8) 8-bit data chunks and 4-bits of parity, so… 1 byte of parity per 2 bytes of data (72,64) 9-byte data chunks per 1 byte of parity bits

Hamming (12,8) Code Suppose have an 8-bit data word and use 4 Hamming parity bits: 0001 P1 : depends on D1, D2, D4, D5, D7 0010 P2 : depends on D1, D3, D4, D6, D7 0011 D1 0100 P3 : depends on D2, D3, D4, D7, D8 0101 D2 0110 D3 0111 D4 1000 P4 : depends on D5, D6, D7, D8 1001 D5 1010 D6 1011 D7 1100 D8

Hamming (12,8) Code Correction Suppose we receive the bits: 0 1 1 1 0 1 0 0 1 1 1 0 How can we determine whether it's correct? Check the parity bits and see which, if any are incorrect. If they are all correct, we must assume the string is correct. Of course, it might contain so many errors that we can't even detect their occurrence, but in that case we have a communication channel that's so noisy that we cannot use it reliably. 0 1 1 1 0 1 0 0 1 1 1 0 OK OK WRONG WRONG So, what does that tell us, aside from that something is incorrect? Well, if we assume there's no more than one incorrect bit, we can say that because the incorrect parity bits are in positions 4 (0100) and 8 (1000), the incorrect bit must be in position 12 (1100).