lec4-overflow coding.pptVIP

*/30 Acknowledgement Thanks everyone for providing materials! Digital Logic Design and Application University of Electronic Science and Technology of China Prof. Shuisheng Lin, 2012 Digital Logic Design and Application University of Electronic Science and Technology of China * Lec4 overflow coding References: Chapter2 – 2.6, 2.7 2.10, 2.11, 2.12, 2.13, 2.15 */30 Outline 补码的加法、减法运算 反码的加法、减法运算 加法、减法运算的溢出判断，为什么会出现溢出 浮点数的表示 常用编码有哪几种?BCD码的加法、减法运算如何修正？ Gray码有何特点？如何由二进制构造出Gray码？ */30 Two’s Compliment Arithmetic (§2.6) Twos complement has advantages when going into Hardware Twos complement addition is straight forward because the numbers are in sequential order (+1) from their least significant (1000 0000 ) to their most significant (0111 1111) There is only one value for Zero, so avoiding the gap isnt necessary */30 Two’s Compliment Arithmetic Addition：(X1＋X2)2cns＝(X1)2cns＋(X2)2cns Subtraction：(X1－X2)2cns ＝(X1)2cns＋(－X2)2cns Addition of two’s compliment numbers is - performed just like standard binary addition, (including the sign bit) - ignoring any carries beyond the MSB. The result of addition or subtraction is a 2’s complement of - Positive number if MSB=0; - Negative number if MSB=1; */30 ex) ＋2 0010 －3 1101 ＋ ＋5 ＋ 0101 ＋ －5 ＋ 1011 ＋7 0111 －8 11000 －5 1011 ＋7 0111 ＋ －6 ＋ 1010 ＋ ＋3 ＋ 0011 －11 10101 =＋5 ＋10 1010 ＝－6 Graphical View The result will always be the correct sum as long as the range of the number system is not exceeded. Discarding carry What’s the problem? */30 0000 0001 0010 0011 0100 0101 1000 1001 1010 1101 1111 1110 1011 1100 0111 0110 +0 +1 +2 +3 +4 +5 ?8 ?7 ?6 ?3 ?1 ?2 ?5 ?4 +7 +6 4-bit 2’s complement number */30 0000 0001 0010 0011 0100 0101 1000 1001 1010 1101 1111 1110 1011 1100 0111 0110 0 1 2 3 4 5 8 9 10 13 15 14 11 12 7 6 4-bit unsigned numbers */30