This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ECE 270 Introduction to Digital System Design © 2011 by D. G. Meyer 1 Lecture Summary – Module 5A Unsigned Number Base Conversion Reference: Text (4 th Ed.), pp. 2534; (3 rd Ed.), pp. 2534 • overview o d n – digits of base R number o c n – converted corresponding digits in base 10 o dealing with unsigned numbers only at this point → leading zeroes don’t matter o table of correspondence • integer conversion: base R to base 10 o method: iterative multiply and add o based on nested expression of a number • integer conversion: base 10 to base R o method: iterative division o remainders become digits of converted number o quotient of zero indicates conversion is complete (d 3 d 2 d 1 d ) R = (N) 10 = c 3 xR 3 + c 2 xR 2 + c 1 xR 1 + c xR = (((c 3 x R + c 2 ) x R + c 1 ) x R + c ) ECE 270 Introduction to Digital System Design © 2011 by D. G. Meyer 2 • short cut for conversion among powers of 2 (from base “A” to base “B”) o method: size log 2 R groupings o write an ndigit binary number for each base A digit in the original number, where n = log 2 A o starting at the least significant position, form mdigit groups, where m = log 2 B ECE 270 Introduction to Digital System Design © 2011 by D. G. Meyer 3 Lecture Summary – Module 5B Signed Number Notation Reference: Text (4 th Ed.), pp. 3439; (3 rd Ed.), pp. 3439 • overview – signed number notations o sign and magnitude (SM) o diminished radix (DR) o radix (R) o only negative numbers are different – positive numbers are the same in all 3 notations • sign and magnitude o vacuum tube vintage o leftmost (“most significant”) digit is sign bit s 0 → positive s R1 → negative (where R is radix or base of number) o positivenegative pairs are called sign and magnitude complements of each other o negation method: replace sign digit (n s ) with R1n s • diminished radix o most significant digit is still sign bit o positivenegative pairs are called diminished radix complements of each other o negation method: subtract each digit (including n s ) from R1, i.e. (N) R = (R n1) R – (N) R • radix o most significant digit is still sign bit o positivenegative pairs are called radix complements of each other o negation method: add one to the DR complement of (N) R , i.e. (N) R = (R n ) R – (N) R • comparison (3bit signed numbers, each notation): • simplifications for binary (base 2) o SM: complement sign position (0 ↔ 1) o DR (also called 1’s complement): complement each bit o R (also called 2’s complement): s add 1 to DR complement or s scan number from right to left and complement each bit to the left of the first “1” encountered • sign extension: SM – pad magnitude with leading zeroes; R and DR – replicate the sign digit Observations : 1. SM and DR have a balanced set of positive and negative numbers (as well as +0 and 0) 2. R notation has a single representation for zero, which results in an “extra negative number” – this unbalanced set of...
View
Full
Document
This note was uploaded on 02/05/2012 for the course ECE 270 taught by Professor Staff during the Spring '08 term at Purdue.
 Spring '08
 Staff

Click to edit the document details