Method for computing remainder of mode number division of integer

Abstract

The present invention provides a method of counting remainder of module division of integer, relating to a method of counting module, characterized in that the counting step includes following: 1. judging size relation of M and D; 2. changing the dividend M to bit; 3. determining numbers of pipeline treatment the first level input parameter according to the dividend M; 4. checking the remainder table stored in the counting device according to the results of coefficients Mi(i=n-1) of each weight, obtaining ri(i=0,1...n-1); 5. ensuring the input parameter of the pipeline treatment the first level; 6. ensuring pipeline level numbers and amount of sub-treating program of each level; 7. ensuring the input parameter of sub-treating flow; 8. starting the counting process of sub-treating process; 9. judging whether all the sub-treating processes being completed or not, if no, changing to the step 7, otherwise, the finally counting result is value of the remainder. The method of counting remainder of module division of integer adopts a pipeline treatment mode, convenient for hardware implementation, overcoming the deficiency of large counting amount of the traditional iterative method, and having no limit to the divisor and the dividend.

Description

technical field [0001] The invention relates to a method for calculating modulus, in particular to a method for calculating the remainder of integer division by modulus. Background technique [0002] The modulus value n of an integer m, usually denoted m mod n. Finding the modulus of an integer has great practical significance, because it is necessary to find the modulus of an integer in many cases, such as in some load balancing methods, packet switching and transmission, digital message encoding / decoding, computer graphics, division Moderate operation. [0003] There are two problems in the existing modulus algorithm: [0004] 1) The traditional algorithm is implemented through iteration, which requires a large amount of calculation. If the divisor D=2N-1 (N is a natural number) is an n-digit integer, the dividend M is less than or equal to (D-1) 2 Any positive integer of , that is, M is a 2n-bit integer when it is the largest, and the traditional iterative method requ...

AI Technical Summary

Problems solved by technology

[0005] 2) Patent 99109437.9 proposes a non-iterative method for calculating the remainder of modulus division, which solves the problem of large amount of calculation caused by iteration, and the algorithm does not depend on the number of digits of the divisor of modulus operation

This shows that this calculation method cannot be applied to the case where the dividend and the divisor are any value

Images