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.

Slides:

Advertisements

Similar presentations

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.

Advertisements

STATISTIC & INFORMATION THEORY (CSNB134) MODULE 12 ERROR DETECTION & CORRECTION.

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

Parity Generator and Checker

ENGIN112 L4: Number Codes and Registers ENGIN 112 Intro to Electrical and Computer Engineering Lecture 4 Number Codes and Registers.

Quantum Error Correction SOURCES: Michele Mosca Daniel Gottesman Richard Spillman Andrew Landahl.

Using Binary Coding Information Remember  Bit = 0 or 1, Binary Digit  Byte = the number of bits used to represent letters, numbers and special characters.

PART III DATA LINK LAYER. Position of the Data-Link Layer.

CS 151 Digital Systems Design Lecture 4 Number Codes and Registers.

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.

Unit 1 Protocols Learning Objectives: Understand the need to detect and correct errors in data transmission.

Hamming It Up with Hamming Codes CSE 461 Section Week 3.

Lesson 2 0x Coding ASCII Code.

1.6 Signed Binary Numbers.

Error Detection and Correction.  Corrupted files  Attachments that won’t open  Files that won’t download  Videos that won’t play Errors occur when.

Digital Logic Chapter 2 Number Conversions Digital Systems by Tocci.

Binary Addition Addition Rules: = = = = = carry 1 1 carry 1 Example 1: Example 2:

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.

Lecture 6 Topics Character codes Error Detection and Correction

Multiplication by multiples of 10 and 100 Objective to multiply numbers when 0’s are involved.

Error Detection and Correction

CS151 Introduction to Digital Design

PART III DATA LINK LAYER. Position of the Data-Link Layer.

Chapter 1: Digital Computers and Information Illustration at beginning of each Chapter Base 10 Binary Base 2 Octal Base 8 Hex bas

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.

Unit 5 Lecture 2 Error Control Error Detection & Error Correction.

1 Representation of Data within the Computer Oct., 1999(Revised 2001 Oct)

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.

Signed Binary Numbers Arithmetic Subtraction – In 2’s-complement form: Example: 1.Take the 2’s complement of the subtrahend (including the sign bit) and.

CCE Department – Faculty of engineering - Islamic University of Lebanon Chapter 6 Binary Arithmetic.

Module –I Codes: Weighted and non-weighted codes

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.

Reasons to  Binary With Mrs

{ Binary “There are 10 types of people in the world: Those who understand binary, and those who don't.”

The ASCII Alphanumeric Code What is it? Why use it? How do we use it?

Data Transmission and Networks Transmission error checking & correcting.

Combinational Logic Design

WHAT IS BINARY? Binary is a number system that only uses two digits: 1 and 0. Any information that processed by a computer it is put into sequence of.

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

Modulo-2 Digital coding uses modulo-2 arithmetic where addition becomes the following operations: 0+0= =0 0+1= =1 It performs the.

Signed binary numbers & Binary Codes

Computer Architecture and Assembly Language

Packetizing Error Detection

Character coding schemes

Error Correcting Code.

Representing characters

Data Encoding Characters.

Folders out, planners out…

Error Detection Bit Error Rate(BER): It is the ratio of number Ne of errors appearing over a certain time interval t to the number Nt of 1 and 0 pulses.

Dhanushiya. R I YEAR BSc COMPUTER TECHNOLOGY.  Error is a condition when the output information does not match with the input information. During transmission,

Packetizing Error Detection

MAT 105 Spring 2008 Chapter 17: Binary Codes.

Packetizing Error Detection

EET107/3 DIGITAL ELECTRONICS 1

Fundamentals of Data Representation

Packetizing Error Detection

Binary “There are 10 types of people in the world: Those who understand binary, and those who don't.”

CS 325: CS Hardware and Software Organization and Architecture

Computer Architecture and Assembly Language

Reliability and Channel Coding

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

Lesson 3.7 Parity Error Checking

Error Detection and Correction

Presentation transcript:

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 has been switched by accident. Odd parity: The number of 1-bit must add up to an odd number Even parity: The number of 1-bit must add up to an even number

Even/odd parity (2) The computer knows which parity it is using If it uses an even parity: If the number of of 1-bit add up to an odd number then it knows there was an error: If it uses an odd: If the number of of 1-bit add up to an even number then it knows there was an error: However, If an even number of 1-bit is flipped the parity will still be the same. But an error occurs The even/parity can’t this detect this error:

Even/odd parity (3) It is useful when an odd number of 1-bits is flipped. Suppose we have an 7-bit binary word (7-digits). If you need to change the parity you need to add 1 (parity bit) to the binary word. You now have 8 digit word. However, the computer knows that the added bit is a parity bit and therefore ignore it.

Example (1) Suppose you receive a binary bit word “0101” and you know you are using an odd parity. Is the binary word errored? The answer is yes: There are 2 1-bit, which is an even number We are using an odd parity So there must have an error.

Parity Bit A single bit is appended to each data chunk makes the number of 1 bits even/odd Example: even parity 1000000(1) 1111101(0) 1001001(1) Example: odd parity 1000000(0) 1111101(1) 1001001(0)

Parity Checking Assume we are using even parity with 7-bit ASCII. The letter V in 7-bit ASCII is encoded as 0110101. How will the letter V be transmitted? Because there are four 1s (an even number), parity is set to zero. This would be transmitted as: 01101010. If we are using an odd parity: The letter V will be transmitted as 01101011

Exercise 1 Suppose you are using an odd parity. What should the binary word “1010” look like after you add the parity bit? Answer: There is an even number of 1-bits. So we need to add another 1-bit Our new word will look like “10101”.

Exercise 2 Suppose you are using an even parity. What should the binary word “1010” look like after you add a parity bit? Answer: There is an even number of 1’s. So we need to add another 0 Our new word will look like “10100”.