实现K位一除,关键是选择每拍应加(减)除数的倍数,使得余数的绝对值足够小,确保整个除法过程收敛。 两个n位(不包括符号位)长的二进制数相除,需做(n+1)/K拍加(减)操作,取得n+1位商(第一位为符号位)。我们对任意第i(i=1,2,…,(n+1)/K)拍操作进行讨论,导出K位除法的运算及上商规则。 K-bit to achieve a division, the key is to choose each beat should be added (minus) the multiple of the divisor, making the absolute value of the remainder small enough to ensure that the entire division process convergence. Divide the two long n binary digits (not including the sign bit) by (n + 1) / K (subtract) to obtain the n + 1 bit quotient (the first bit is the sign bit). We discuss the operation of any i-th (i = 1, 2, ..., (n + 1) / K) tap operation and derive the operation of K-bit division and the quotient quotient rule.