网站大量收购独家精品文档,联系QQ:2885784924

原码、反码、补码、移码的一些说明(The original code, complement, complement, shift some description code).doc

原码、反码、补码、移码的一些说明(The original code, complement, complement, shift some description code).doc

  1. 1、本文档共12页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
原码、反码、补码、移码的一些说明(The original code, complement, complement, shift some description code)

原码、反码、补码、移码的一些说明(The original code, complement, complement, shift some description code) The original code, complement, complement, shift some description code Definition of the original code, complement, complement 1, the definition of the source code The definition of the decimal code [X] = X 0 X 1 1X1 X 0 For example: X=+0.1011, [X] = 01011 X=0.1011 [X] = 11011 The definition of the integer source code [X] = 0 X X 2n 2nX2n X 0 2, the definition of complement Definition of decimal complement [X] complement = X 0 X 1 2X1 X 0 For example: X=+0.1011, [X] = 01011 X=0.1011, [X] = 10101 Definition of integer complement [X] complement = 0 X X 2n 2n+1X2n X 0 3, the definition of complement The definition of negative decimal [X] = X 0 X 1 22n-1X1 X 0 For example: X=+0.1011 [X] = 01011 X=0.1011 [X] = 10100 The definition of negative integer [X] = 0 X X 2n 2n+11X2n X 0 4. shift code: the shift code is used only for floating-point codes, so it is for integers only. The frameshift definition: set consists of 1 bits and N bits of the order numerical code, [X] + X -2n shift =2n = X = 2n For example: X=1011 [X] shift =11011 symbol 1 is a plus X=1011 [X] shift =00101 sign bit 0 sign The relationship between the shift code and complement: [X] shift relations with [X] complement each other is the sign bit complement, For example: [X] =11011 [X] =01011 X=1011 shift compensation [X] =00101 [X] =10101 X=1011 shift compensation Problems needing attention in code shifting operation: The operation result of frameshift need revision, correction for 2n, namely the sign bit inversion is the correct results in the form of frameshift. The frameshift said, there are only 0 - 1000 encoding... 00, when 000 appears... 00 (said 2n), which belongs to the floating point underflow. Two, complement plus minus operation rules 1, operation rules [XY] = [X] [Y] supplement supplement supplement [XY] = [X] [Y] supplement supplement supplement If the [Y] complement is known, the [Y] compl

您可能关注的文档

文档评论(0)

jgx3536 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:6111134150000003

1亿VIP精品文档

相关文档