| 摘要 |
PROBLEM TO BE SOLVED: To make a computation speed of Miller algorithm high, specifically, to decrease a computational complexity when ellipse double precision operation continues twice. SOLUTION: X<SB>Q'</SB><SP>3</SP>and X<SB>Q'</SB><SP>2</SP>are calculated beforehand and recorded in a record section. If necessary, X<SB>Q'</SB><SP>3</SP>and X<SB>Q'</SB><SP>2</SP>are read out from the record section and computation of l<SB>2(n)</SB>(Q')<SP>2</SP>×xl<SB>2(n-1)</SB>(Q')=(X<SB>Q'</SB>-X<SB>n</SB>)<SP>2</SP>(X<SB>Q'</SB>-X<SB>n-1</SB>)is computed by X<SB>Q'</SB><SP>3</SP>-(2X<SB>n</SB>+X<SB>n-1</SB>)X<SB>Q'</SB><SP>2</SP>+(2X<SB>n</SB>X<SB>n-1</SB>+X<SB>n</SB>)X<SB>Q'</SB>-X<SB>n</SB>X<SB>n-1</SB>. Here, a straight line for connecting 2T with O by ellipse double precision computation in recursive processing corresponding to the n-th bit, is l<SB>2(n)</SB>(x,y)=0. COPYRIGHT: (C)2007,JPO&INPIT
|
