| 摘要 |
The integer division is of the type q = a div b and r = a mod b, where a is a m-bit number, b a n-bit number with n less than or equal to m. At each iteration of a loop between 1 and m-n+1, a partial division is performed, with the same operations performed at each iteration, using successive subtraction or addition of complements. |
