Http://faculty.chemeketa.edu/ascholer/cs160/Files/ecGrid.html.

Slides:



Advertisements
Similar presentations
Error-Correcting codes
Advertisements

DIGITAL COMMUNICATION Packet error detection (CRC) November 2011 A.J. Han Vinck.
STATISTIC & INFORMATION THEORY (CSNB134) MODULE 12 ERROR DETECTION & CORRECTION.
Hamming Code.
parity bit is 1: data should have an odd number of 1's

Quantum Error Correction SOURCES: Michele Mosca Daniel Gottesman Richard Spillman Andrew Landahl.
Practical Session 11 Codes. Hamming Distance General case: The distance between two code words is the amount of 1-bit changes required to reach from one.
Error detection and correction
Reliability and Channel Coding
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.
Forward Error CORRECTION A little magic. Hamming in perspective Typically errors are corrected with retransmission. Hamming lets the receiver determine.
Hamming It Up with Hamming Codes CSE 461 Section Week 3.
MAT 1000 Mathematics in Today's World Winter 2015.
PrasadDigital Roots1 VEDIC MATHEMATICS : Digital Roots/Sums T. K. Prasad
Error Detection and Correction.  Corrupted files  Attachments that won’t open  Files that won’t download  Videos that won’t play Errors occur when.
Cosc 2150: Computer Organization
E RROR D ETECTION A ND C ORRECTION C ODES Error Detection Code (Parity bit) Error Correction Code ( Hamming Code)
CIT 307 Online Data Communications Error Detection Module 11 Kevin Siminski, Instructor.
Error Coding Transmission process may introduce errors into a message.  Single bit errors versus burst errors Detection:  Requires a convention that.
Error Control Code. Widely used in many areas, like communications, DVD, data storage… In communications, because of noise, you can never be sure that.
COEN 180 Erasure Correcting, Error Detecting, and Error Correcting Codes.
Data and Computer Communications Chapter 6 – Digital Data Communications Techniques.
Data and Computer Communications by William Stallings Eighth Edition Digital Data Communications Techniques Digital Data Communications Techniques Click.
Practical Session 10 Error Detecting and Correcting Codes.
Riyadh Philanthropic Society For Science Prince Sultan College For Woman Dept. of Computer & Information Sciences CS 251 Introduction to Computer Organization.
MAT 105 Spring  An identification number is a sequence of letters and/or numbers that identifies an object, person, place, or concept  The number.
Error Detection and Correction
Communication Systems 3.1) Characteristics of a Communication System.
1 Rectangular Codes Triplication codes: m 1 m 2 m 3 m 1 m 1 m 1 m 2 m 2 m 2 m 3 m 3 m 3 Repeated 3 times At receiving end, a majority vote is taken.
David Wetherall Professor of Computer Science & Engineering Introduction to Computer Networks Error Detection (§3.2.2)
Computer Science Division
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.
VLSI AND INTELLIGENT SYTEMS LABORATORY 12 Bit Hamming Code Error Detector/Corrector December 2nd, 2003 Department of Electrical and Computer Engineering.
1 © Unitec New Zealand CRC calculation and Hammings code.
CS 111 – Sept. 13 Error detection Error correction Review/practice chapter 1 questions Commitment: –Please read sections 2.1 and 2.2.
Data Link Layer. Data Link Layer Topics to Cover Error Detection and Correction Data Link Control and Protocols Multiple Access Local Area Networks Wireless.
Error Detection and Correction
Error-Detecting and Error-Correcting Codes
Math for Liberal Studies. What is an identification number?  An identification number is a sequence of digits and/or numbers that identifies an object,
Computer Architecture Error Correcting Codes Ralph Grishman Oct (Text pp and B-65-67) NYU.
Hamming (4,7) Code Binary Linear Codes Hamming Distance Weight of BLC
Data Link Layer 1. 2 Single-bit error 3 Multiple-bit error 4.
Error Detecting and Error Correcting Codes
ERROR DETECTION AND CORRECTION Chapter 8 Data Communications & Networking ERROR DETECTION AND CORRECTION Chapter 8 First Semester 2007/2008.
2.8 Error Detection and Correction
ERROR DETECTION AND CORRECTION
Cyclic Redundancy Check (CRC)
ERROR CORRECTING CODES
OCR AS Level F451: Data transmission
Representing characters
Error Detection and Correction
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.
Welcome to the presentation. Linear Block Codes Almost all block codes used today belong to a subset called linear block codes. The exclusive OR of two.
Dhanushiya. R I YEAR BSc COMPUTER TECHNOLOGY.  Error is a condition when the output information does not match with the input information. During transmission,
Chapter 9 Error Detection and Correction
Dr. Clincy Professor of CS
DATA COMMUNICATION Lecture-35.
RAID Redundant Array of Inexpensive (Independent) Disks

주민등록번호.
CS 325: CS Hardware and Software Organization and Architecture
Reliability and Channel Coding
Reliability and Channel Coding
Lesson 3.7 Parity Error Checking
Types of Errors Data transmission suffers unpredictable changes because of interference The interference can change the shape of the signal Single-bit.
Error Detection and Correction
Error Detection Learning Objectives:
2.8 Error Detection and Correction
Presentation transcript:

http://faculty.chemeketa.edu/ascholer/cs160/Files/ecGrid.html

Error Detection and Correction Fixing 0101X011

Computer Errors RAM isn't perfect

Computer Errors Networks aren't either

Computer Errors How the heck do you read 1s and 0's off this?

Pinpoint How did I do it?

Pinpoint Message / Check Bit Every Row & Col should have odd # of black squares

Pinpoint How did I do it? Every Row & Col should have odd # of black squares

Real Life Checksum Last digit of credit card number calculated to http://tywkiwdbi.blogspot.com/2012/06/checksum-number-on-credit-card.html

Real Life Stair Case ISBN – books: http://www-math.ucdenver.edu/~wcherowi/jcorner/isbn.html

Hamming Codes

Hamming Code Message Coded Message 0000  0001  0010  0011  0000000 Use extra bits to "space out" messages 4 bit message with 3 error correction bits: Message Coded Message 0000  0001  0010  0011  0000000 0001011 0010111 0011100

Hamming Code 7 bits could be 27 = 128 codes Only use 16 of them 0000000   1000110 0001011 1001101 0010111 1010001 0011100 1011010 0100101 1100011 0101110 1101000 0110010 1110100 0111001 1111111

Hamming Code Every good message has distance of 3+ from other good messages: 0000000   1000110 0001011 1001101 0010111 1010001 0011100 1011010 0100101 1100011 0101110 1101000 0110010 1110100 0111001 1111111

Our Message We get: 0110110 Which message was it meant to be? 0000000   1000110 0001011 1001101 0010111 1010001 0011100 1011010 0100101 1100011 0101110 1101000 0110010 1110100 0111001 1111111

Errors Assuming Then Started with valid code word Only one error 1 bit from one valid word 2+ bits from another valid code word Valid Code A Valid Code B Valid Code C Error

Our Message We get: 0110110 Find the closest match: The message was supposed to be 0110010 0000000   1000110 0001011 1001101 0010111 1010001 0011100 1011010 0100101 1100011 0101110 1101000 0110010 1110100 0111001 1111111

Hamming Code Hamming Codes as pinpoint parity checks: http://www.systems.caltech.edu/EE/Faculty/rjm /SAMPLE_20040708.html

Hamming Code Overhead Message size : 4 bits Code word: 7 bits 512bit message can be encoded with 522bits: 2% overhead!