# CH1C - Introduction, Introduction Number systems and...

This preview shows pages 1–5. Sign up to view the full content.

ntroduction Number systems Introduction, Number systems and Conversion (C) Hasan Zidan Department of Electrical Engineering AUST 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
One’s Complement Representation One’s complement is another way to represent signed integers. To encode a negative number, get the binary representation of its magnitude, then COMPLEMENT each bit. Complementing ch bit means replacing y nd y each bit means replacing 1 by 0 and 0 by 1. What is - 5 in One’s Complement, 8 bits? he magnitude - its is 000 0101 The magnitude 5 in 8 bits is 0000 0101 Now complement each bit: 1111 1010 is the 8-bit, one’s complement of -5. NOTE: positive numbers in 1 s complement re simply their binary representation 2 are simply their binary representation.
One’s Complement Examples -5 = 1111 1010 +5 = 0000 0101 +127 = 0111 1111 -127 = 1000 0000 000 0000 + 0 = 0000 0000 - 0 = 1111 1111 it t th i d i t 55 + 55 For 8 bits, can represent the signed integers -255 to +255. For N bits, can represent the signed integers -(2 N – 1) to + (2 N –1) 3

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
One’s Complement (cont.) 1. Addition of two positive no’s., sum < 2 (n=8) n 1 +25 0001 1001 +14 +39 0000 1110 0010 0111 Correct answer + 2. Addition of two positive no’s., sum >= 2
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 03/10/2012 for the course ENGINEERIN 131231 taught by Professor Dr.hamad during the Spring '12 term at Amity University.

### Page1 / 12

CH1C - Introduction, Introduction Number systems and...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online