July 2002
Intermediate to advanced
320 pages
8h 15m
English
Given a word size W ≥ 1 and a divisor d, 1 ≤ d < 2W, we wish to find the least integer m and integer p such that
Equation 22
![]()
with 0 ≤ m < 2W + 1 and p ≥ W.
In the unsigned case, the magic number M is given by
![]()
Because (22) must hold for
Equation 23
![]()
As in the signed case, let nc be the largest value of ...
Read now
Unlock full access