The principle of binary division: set the dividend to be A, the divisor to B, the quotient to Q (initial value is 0), and the remainder to be R (initial value is 0). Set a Q unit and an R unit, and A moves from the high to the low to the left and then into the R unit. Compare R after each shift The value of the unit and B, if R ≥ B, set the value of the quotient unit of this bit to 1, and then subtract B from the R (to do the complement addition), otherwise no operation. The quotient unit is synchronized with the shift. ... until A all enters the R unit. At this time, the remainder is stored in the storeer and R in Q.
Comment list ( 0 )