A Method to Correct Data Corrupted by Overflow Ben Christensen Jay Brady Dec. 5, 2013.

Slides:



Advertisements
Similar presentations
ELEC353 S. al Zahir UBC Sign-Magnitude Representation High order bit is sign: 0 = positive (or zero), 1 = negative Low order bits represent the magnitude:
Advertisements

James Tam Numerical Representations On The Computer: Negative And Rational Numbers How are negative and rational numbers represented on the computer? How.
James Tam Numerical Representations On The Computer: Negative And Rational Numbers How are negative and rational numbers represented on the computer? How.
James Tam Numerical Representations On The Computer: Negative And Rational Numbers How are negative and rational numbers represented on the computer? How.
Computer Structures Lecture 2: Working with 0’s and 1’s.
Booth’s Algorithm.
Sistemas Digitais I LESI - 2º ano Lesson 2 - Number Systems U NIVERSIDADE DO M INHO E SCOLA DE E NGENHARIA Prof. João Miguel Fernandes
1 Binary Arithmetic, Subtraction The rules for binary arithmetic are: = 0, carry = = 1, carry = = 1, carry = = 0, carry =
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
Signed Numbers CS208. Signed Numbers Until now we've been concentrating on unsigned numbers. In real life we also need to be able represent signed numbers.
1 Binary Numbers Again Recall that N binary digits (N bits) can represent unsigned integers from 0 to 2 N bits = 0 to 15 8 bits = 0 to bits.
Chapter 3 Data Representation part2 Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2010.
NEGATIVE BINARY NUMBER – Digital Circuit 1 Choopan Rattanapoka.
1.6 Signed Binary Numbers.
Over-Sampling and Multi-Rate DSP Systems
Binary Representation - Shortcuts n Negation x + x = 1111…1111 two = -1 (in 2’s complement) Therefore, -x = x + 1 n Sign Extension o Positive numbers :
Chapter3 Fixed Point Representation Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
© Janice Regan, CMPT 128, Jan CMPT 128: Introduction to Computing Science for Engineering Students Integer Data representation Addition and Multiplication.
Simple Data Type Representation and conversion of numbers
Lecture 5.
A-Level Computing Data representation. Objectives Know how data can be represented in a computer system Understand the need for various forms of representation.
Conversion Between Lengths Positive number pack with leading zeros +18 = = Negative numbers pack with leading ones -18 =
Number Systems Part 2 Numerical Overflow Right and Left Shifts Storage Methods Subtraction Ranges.
NUMBER REPRESENTATION CHAPTER 3 – part 3. ONE’S COMPLEMENT REPRESENTATION CHAPTER 3 – part 3.
Data Representation in Computer Systems
Topic: Arithmetic Circuits Course: Digital Systems Slide no. 1 Chapter # 5: Arithmetic Circuits.
CH09 Computer Arithmetic  CPU combines of ALU and Control Unit, this chapter discusses ALU The Arithmetic and Logic Unit (ALU) Number Systems Integer.
CPS120: Introduction to Computer Science Computer Math: Signed Numbers.
Calculating Two’s Complement. The two's complement of a binary number is defined as the value obtained by subtracting the number from a large power of.
1 Digital Design: Number Systems Credits : Slides adapted from: J.F. Wakerly, Digital Design, 4/e, Prentice Hall, 2006 C.H. Roth, Fundamentals of Logic.
Representation of Data Ma King Man. Reference Text Book: Volume 2 Notes: Chapter 19.
©Brooks/Cole, 2003 Chapter 3 Number Representation.
ECE 301 – Digital Electronics Unsigned and Signed Numbers, Binary Arithmetic of Signed Numbers, and Binary Codes (Lecture #2)
Summer 2012ETE Digital Electronics1 Binary Arithmetic of Signed Binary Numbers.
Multimedia Data Introduction to Image Processing Dr Sandra I. Woolley Electronic, Electrical.
BR 8/99 Binary Numbers Again Recall than N binary digits (N bits) can represent unsigned integers from 0 to 2 N bits = 0 to 15 8 bits = 0 to 255.
Chapter 3: Image Restoration Introduction. Image restoration methods are used to improve the appearance of an image by applying a restoration process.
Positional Number Systems
Number Representation
ECE2030 Introduction to Computer Engineering Lecture 2: Number System Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering Georgia Tech.
ECE 2110: Introduction to Digital Systems Signed Addition/Subtraction.
Operations on Bits Arithmetic Operations Logic Operations
ECE 331 – Digital System Design Representation and Binary Arithmetic of Negative Numbers and Binary Codes (Lecture #10) The slides included herein were.
07/12/ Data Representation Two’s Complement & Binary Arithmetic.
Addition and Substraction
Digital Logic Lecture 3 Binary Arithmetic By Zyad Dwekat The Hashemite University Computer Engineering Department.
MIPS ALU. Building from the adder to ALU ALU – Arithmetic Logic Unit, does the major calculations in the computer, including – Add – And – Or – Sub –
Bits, Data types, and Operations: Chapter 2 COMP 2610 Dr. James Money COMP
IT1004: Data Representation and Organization Negative number representation.
DEPARTMENTT OF ECE TECHNICAL QUIZ-1 AY Sub Code/Name: EC6502/Principles of digital Signal Processing Topic: Unit 1 & Unit 3 Sem/year: V/III.
ECE 171 Digital Circuits Chapter 2 Binary Arithmetic Herbert G. Mayer, PSU Status 1/14/2016 Copied with Permission from prof. Mark PSU ECE.
James Tam Numerical Representations On The Computer: Negative And Rational Numbers How are negative and rational numbers represented on the computer? How.
Two’s and one’s complement arithmetic CLOCK ARITHMETIC.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 8 Dr. Shi Dept. of Electrical and Computer Engineering.
09/03/20161 Information Representation Two’s Complement & Binary Arithmetic.
Sampling and Digitisation. Digitisation Real-life images and sounds need to be digitised for computer representation. Turning an analogue or continuous.
ECE 3110: Introduction to Digital Systems Signed Number Conversions and operations.
{ Binary “There are 10 types of people in the world: Those who understand binary, and those who don't.”
1 Integer Representations V1.0 (22/10/2005). 2 Integer Representations  Unsigned integer  Signed integer  Sign and magnitude  Complements  One’s.
Binary Addition The simplest arithmetic operation in binary is addition. Adding two single-digit binary numbers is relatively simple, using a form of carrying:
Lecture 2 Topics Binary Arithmetic (Unsigned binary operands)
Digital Image Processing
Lecture 2 Topics Binary Arithmetic (Unsigned binary operands)
Dhanushiya. R I YEAR BSc COMPUTER TECHNOLOGY.  Error is a condition when the output information does not match with the input information. During transmission,
DEPARTMENT OF INFORMATION TECHNOLOGY DIGITAL SIGNAL PROCESSING UNIT 4
DEPARTMENT OF INFORMATION TECHNOLOGY DIGITAL SIGNAL PROCESSING UNIT 4
Chapter3 Fixed Point Representation
Presentation transcript:

A Method to Correct Data Corrupted by Overflow Ben Christensen Jay Brady Dec. 5, 2013

Topics A brief introduction to overflow. How do we identify a signal which has been corrupted by overflow? How can we correct a corrupted signal? What kind of signals can be corrected? New moving average based unwrap method. Conclusion.

Overflow Overflow is a problem that can occur in Digital Signal Processing (DSP). Overflow occurs when a value is represented in binary using an insufficient number of bits. Systems are usually designed to avoid overflow, but this is not always possible.

Overflow The value of ‘5’ using two’s compliment is 0101 this requires 4 bits -- 1 ‘sign’ bit plus 3 ‘value’ bits If you try to represent a number using fewer bits, you may lose information and possibly change the sign bit has a decimal value of has a decimal value of -3!

Overflow Example: 9-bit Sine wave represented with 8 bits

Overflow Identification For continuous signals, look for sharp jumps or discontinuities. If the signal is noisy, you need to look at the distribution. ◦ The distribution will be limited to values within the representable range

Overflow Identification Example:

Correcting Signals with Overflow If continuous and noise-free, a simple ‘unwrap’ function can be used. But how can we correct the signal if noise is present? ◦ A more sophisticated ‘unwrap’ function can be used.

Assumptions The signal must be slowly-varying. The signal must be finely sampled. The noise cannot exceed the total bit- range. ◦ Our simulations were done using fairly low- frequency sinusoids.

Signal Model Signals are sinusoidal with added Gaussian noise.

Signal Model If the signal overflows, it has an added ‘overflow factor.’ m – number of times the signal has overflown (positive or negative). b – number of bits.

Moving Average Unwrap If can be subtracted from the original signal can be restored. The trick is finding m and n (i.e. how much correction and where?)

Correcting the signal Regions of overflow are identified using a moving average estimator ◦ The difference between the moving average and signal must be under the overflow detection threshold for some number of samples “c” The value of the function before and after these regions are used to determine the correction factor needed ( -2 b, 0, or 2 b ) The areas of overflow are removed, and the correction terms added

Using moving averages to locate overflow regions

0-bit noise (no noise)

7-bit noise

8-bit noise

Conclusions Continuous signals with added noise that suffer from overflow can be corrected for given: The sampling frequency is much greater than frequencies that make up the signal The noise is limited below the bin limits

Questions?