| 摘要 |
<P>PROBLEM TO BE SOLVED: To perform arithmetic of R=x<SB>1</SB>r<SB>1</SB>+.... +x<SB>I</SB>r<SB>I</SB>at high speed by multiple length arithmetic for an integer x<SB>i</SB>having large data size. <P>SOLUTION: First, x<SB>i</SB>is divided for each x<SB>i</SB>(j) each having a bit length of ω(j), wherein j is the elements of a set ä1...., J}, and J is an integer which is 2 or more, and x<SB>i</SB>is a bit coupling x<SB>i</SB>=x<SB>i</SB>(J)¾... ¾x<SB>i</SB>(1) of the x<SB>i</SB>(J)...., x<SB>i</SB>(1). Then, arithmetic of T(j)=α(j)+x<SB>1</SB>(j)r<SB>1</SB>+.....+x<SB>I</SB>(j)r<SB>I</SB>is performed by using α(j), and x<SB>i</SB>(j) and r<SB>i</SB>read in a cache memory, and processing where the low rank ω(j) bit of the T(j) is set to R<SB>j</SB>, and any bit other than the R<SB>j</SB>of T(j) is set to new α(j+1) is performed until j=J by increasing j one by one from j=1 using J=1 and α=0 as initial values. Afterwards, a bit coupling R=α(J)¾R<SB>J</SB>¾... ¾R<SB>1</SB>of the α(J), R<SB>J</SB>...., R<SB>1</SB>is calculated, and R is output. <P>COPYRIGHT: (C)2009,JPO&INPIT |
