计算机组成原理no4数据的表示和运算3.pptVIP

* 补码比较法（Booth 算法） 设[x]补 = x0.x1x2 xn [y]补 = y0.y1y2 yn … … [x · y]补 = [x]补( 0.y1 yn ) – [x]补 · y0 … = [x]补(y1 2-1+y22-2+ +yn2-n) – [x]补 · y0 … = [x]补(–y0+y1 2-1+y22-2+ +yn2-n) … = [x]补[–y0+(y1 – y12-1)+(y22-1–y22-2)+ +(yn2-(n-1)–yn2-n)] … = [x]补[(y1–y0)+(y2–y1)2-1+ +(yn–yn-1)2-(n-1)+(0 –yn)2-n)] … y1 2-1 + + … yn 2-n –[x]补= +[–x]补 2-1 = 20 – 2-1 2-2 = 2-1 – 2-2 = [x]补[(y1–y0)+(y2–y1)2-1+ +(yn+1–yn)2-n] … 附加位 yn+1 * Booth 算法递推公式 [z0]补= 0 [z1]补= 2-1{(yn+1–yn)[x]补+[z0]补} yn+1 = 0 [zn]补= 2-1{(y2–y1)[x]补+[zn-1]补} … [x · y]补= [zn]补+(y1–