Calculation method for division of digital data, calculation apparatus for division of digital data, and program therefor

1. A calculation apparatus for obtaining a solution z of division of a dividend y which is a digital datum of m bits (m≧1) by a divisor x by using a computer, the calculation apparatus comprising:

storage means for storing a table (i) corresponding to an i th lowest bit block among n bit blocks (n≧i≧1) generated by partitioning m bits from the least significant bit at bit positions expressed by elements of a sequence {a n }, the table relating values that can be expressed by the bits between an (a i−1 +1) th lowest bit and an a i th lowest bit with solutions z(i) obtained by dividing, by the divisor x, values that can be expressed by the bits between the least significant bit and the a i th lowest bit wherein the bits between the least significant bit and an (a i−1 ) th lowest bit are replaced with 0;

partitioning means for partitioning from the least significant bit the dividend y that is the digital datum of m bits in to n bit blocks y( 1 ) to y(n) at the bit positions expressed by the elements of the sequence {a n };

table reference means for finding, in the i th lowest bit block y(i) partitioned by the partitioning means, the solution z(i) obtained by dividing by the divisor x the value that is expressed by the bits of the dividend y between the least significant bit and the a i th lowest bit wherein the bits between the least significant bit and the (a i−1 ) th lowest bit are replaced with 0, by referring to the table (i); and

addition means for finding the solution z by adding the solutions z(i) found for the respective bit blocks by the table reference means.

2. A calculation method for faster processing of an image data represented by dividend y, by obtaining a solution z of division of the dividend y which is a digital datum of m bits (m≧1) by a divisor x by using a computer, the calculation method comprising the steps of:

generating a table (i) corresponding to an i th lowest bit block among n bit blocks (n≧i≧1) generated by partitioning m bits from the least significant bit at bit positions expressed by elements of a sequence {a n }, the table relating values that can be expressed by the bits between an (a i−1 +1) th lowest bit and an a i th lowest bit with solutions z(i) obtained by dividing, by the divisor x, values that can be expressed by the bits between the least significant bit and the a i th lowest bit wherein the bits between the least significant bit and an (a i−1 ) th lowest bit are replaced with 0;

partitioning from the least significant bit the dividend y that is the digital datum of m bits into n bit blocks y( 1 ) to y(n) at the bit positions expressed by the elements of the sequence {a n };

finding in the i th lowest bit block y (i) the solution z (i) obtained by dividing by the divisor x the value that is expressed by the bits of the dividend y between the least significant bit and the a i th lowest bit wherein the bits between the least significant bit and the (a i−1 ) th lowest bit are replaced with 0, by referring to the table (i); and

finding the solution z by adding the solutions z(i) found for the respective bit blocks; and

filtering processing in image processing or interpolation processing in image processing, in accordance with the solution z of the division of the dividend y.

3. A calculation method for faster processing of an image data represented by dividend y, by obtaining a solution z of division of the dividend y which is a digital datum of m bits (m≧1) by a divisor x by using a computer, the calculation method comprising the steps of:

generating a table (i) corresponding to an i th lowest bit block among n bit blocks (n≧i≧1) generated by partitioning m bits from the least significant bit at bit positions expressed by elements of a sequence {a n }, the table relating values that can be expressed by the bits between (a i−1 +1) th lowest bit and an a i th lowest bit with solutions z(i) obtained by dividing, by the divisor x, values that can be expressed by the bits between the least significant bit and the a i th lowest bit wherein the bits between the least significant bit and an (a i−1 ) th lowest bit are replaced with 0;

partitioning from the least significant bit the dividend y that is the digital datum of m bits into n bit blocks y( 1 ) to y(n) at the bit positions expressed by the elements of the sequence {a n };

finding in the i th lowest bit block y (i) the solution z (i) obtained by dividing by the divisor x the value that is expressed by the bits of the dividend y between the least significant bit and the a i th lowest bit wherein the bits between the least significant bit and the (a i−1 ) th lowest bit are replaced with 0, by referring to the table (i); and

finding the solution z by adding the solutions z(i) found for the respective bit blocks; and

performing one of tone processing of the image data, frequency enhancement processing for emphasizing soft-tissue, bones or mediastinum, soft-tissue or bone display processing using energy subtraction, and enlargement/reduction processing of the image data, in accordance with the solution z.

4. The calculation method as claimed in claims 2 or 3 , wherein a n of the sequence {a n } comprises a n =jn, where j is an integer.

5. The calculation method as claimed in claims 2 or 3 , wherein the sequence {a n }comprises an arithmetic sequence.

6. The calculation method as claimed in claims 2 or 3 , wherein a n of the sequence {a n } is such that the digital datum is partitioned at every b bits, wherein b is an integer.

7. The calculation method as claimed in claims 2 or 3 , wherein the (a i−1 1) th lowest bit is less significant than the (a i ) th lowest bit in the i th lowest bit block.

8. The calculation method as claimed in claims 2 or 3 , further comprising generating another table (ii) corresponding to ii th lowest bit block among n bit blocks (n≧ii≧1), wherein ii≠i.

9. A program embodied on a computer readable medium that causes a computer to execute a method for faster processing of an image data represented by dividend y, by obtaining a solution z of division of the dividend y which is a digital datum of in bits (m≧1) by a divisor x, the computer storing a table (i) corresponding to an i th lowest bit block among n bit blocks (n≧i≧1) generated by partitioning m bits from the least significant bit at bit positions expressed by elements of a sequence {a n }, the table relating values that can be expressed by the bits between an (a i−1 +1) th lowest bit and an a i th lowest bit with solutions z(i) obtained by dividing, by the divisor x, values that can be expressed by the bits between the least significant bit and the a i th lowest bit wherein the bits between the least significant bit and an (a i−1 ) th lowest bit are replaced with 0, the program comprising the procedures of:

partitioning the dividend y that is the digital datum of m bits into n bit blocks y( 1 ) to y (n) at the bit positions expressed by the elements of the sequence {a n } from the least significant bit;

finding in the i th lowest bit block y(i) the solution z(i) obtained by dividing by the divisor x the value that is expressed by the bits of the dividend y between the least significant bit and the a i th lowest bit wherein the bits between the least significant bit and the (a i−1 ) th lowest bit are replaced with 0, while referring to the table (i); and

finding the solution z by adding the solutions z(i) found for the respective bit blocks; and

filtering processing in image processing or interpolation processing in image processing, in accordance with the solution z of the division of the dividend y.

10. A program embodied on a computer readable medium that causes a computer to execute a method for faster processing of an image data represented by dividend y, by obtaining a solution z of division of the dividend y which is a digital datum of m bits (m≧1) by a divisor x, the computer storing a table (i) corresponding to an i th lowest bit block among n bit blocks (n≧i≧1) generated by partitioning m bits from the least significant bit at bit positions expressed by elements of a sequence {a n }, the table relating values that can be expressed by the bits between an (a i−1 +1)th lowest bit and an a i th lowest bit with solutions z(i) obtained by dividing, by the divisor x, values that can be expressed by the bits between the least significant bit and the a i th lowest bit wherein the bits between the least significant bit and an (a i−1 ) th lowest bit are replaced with 0, the program comprising the procedures of:

partitioning the dividend y that is the digital datum of m bits into n bit blocks y( 1 ) to y (n) at the bit positions expressed by the elements of the sequence {a n } from the least significant bit; and

finding in the i th lowest bit block y(i) the solution z(i) obtained by dividing by the divisor x the value that is expressed by the bits of the dividend y between the least significant bit and the a i th lowest bit wherein the bits between the least significant bit and the (a i−1 ) th lowest bit are replaced with 0, while referring to the table (i); and

finding the solution z by adding the solutions z(i) found for the respective bit blocks; and

performing one of tone processing of the image data, frequency enhancement processing for emphasizing soft-tissue, bones or mediastinum, soft-tissue or bone display processing using energy subtraction, and enlargement/reduction processing of the image data, in accordance with the solution z.

11. A program embodied on a computer readable medium that causes a computer to execute a calculation method for faster processing of an image data represented by data of m bits, the program comprising the procedures of:

a) partitioning the data of m bits by bit positions expressed by elements of a sequence {a n }, into n number of bit blocks y( 1 ) to y(n), n being an integer;

b) generating a table (i) corresponding to block y(i), wherein i is an integer such that 1 ≦i≦n, the table (i) comprising values expressed by bits between a least significant bit and a i th bit, wherein the bits between the least significant bit and (a i−1 ) th bit are replaced with 0;

c) calculating a solution z(i) by dividing each of the values in the table (i) by divisor x;

d) repeating operations a)-c) for all integer values of i to calculate solutions z(i) for all i; and

e) determining solution z by summing the solutions z(i) for all i; and

f) filtering processing in image processing or interpolation processing in image processing, in accordance with the solution z.

12. A program embodied on a computer readable medium that causes a computer to execute a calculation method for faster processing of an image data represented by data of m bits, the program comprising the procedures of:

a) partitioning the data of m by bit positions expressed by elements of a sequence {a n }, into n number of bit blocks y( 1 ) to y(n), n being an integer;

b) generating a table (i) corresponding to block y(i), wherein i is an integer such that 1 ≦i≦n, the table (i) comprising values expressed by bits between a least significant bit and a i th bit, wherein the bits between the least significant bit and (a i−1) th bit are replaced with 0;

c) calculating a solution z(i) by dividing each of the values in the table (i) by divisor x;

d) repeating operations a)-c) for all integer values of i to calculate solutions z(i) for all i; and

e) determining solution z by summing the solutions z(i) for all i; and

f) performing one of tone processing of the image data, frequency enhancement processing for emphasizing soft-tissue, bones or mediastinum, soft-tissue or bone display processing using energy subtraction, and enlargement/reduction processing of the image data, in accordance with the solution z.

13. The calculation method of claims 11 or 12 , wherein the data is partitioned at every b bits, wherein b is an integer.

14. A calculation method for faster processing of an image data represented by data of m bits, the method comprising:

a) partitioning the data of m bits by bit positions expressed by elements of a sequence {a n }, into n number of bit blocks y( 1 ) to y(n), n being an integer;

b) calculating a solution z(c i ) by dividing each of values expressed by bit block y(i) by divisor x, wherein 1≦i≦n;

c) calculating a solution z(i) by multiplying z(c i ) by 2 (i−1)·b , b being a block size in number of bits;

d) repeating operations a)-c) for all integer values of i, to calculate solutions z(i) for all i; and

e) determining solution z by summing the solutions z(i) for all i; and

f) filtering processing in image processing or interpolation processing in image processing, in accordance with the solution z.

15. A calculation method for faster processing of an image data represented by data of m bits, the method comprising:

a) partitioning the data of m bits by bit positions expressed by elements of a sequence {a n }, into n number of bit blocks y( 1 ) to y(n), n being an integer;

b) calculating a solution z(c i ) by dividing each of values expressed by bit block y(i) by divisor x, wherein 1≦i≦n;

c) calculating a solution z(i) by multiplying z(c i ) by 2 (i−1)·b , b being a block size in number of bits;

d) repeating operations a)-c) for all integer values of i, to calculate solutions z(i) for all i; and

e) determining solution z by summing the solutions z(i) for all i; and

f) performing one of tone processing of the image data, frequency enhancement processing for emphasizing soft-tissue, bones or mediastinum, soft-tissue or bone display processing using energy subtraction, and enlargement/reduction processing of the image data, in accordance with the solution z.

16. The calculation method of claims 14 or 15 , wherein the data is partitioned at every b bits, wherein b is an integer.