← Back to Patent Explorer
US6850960B2 Expired / Lapsed US ⏱️ 0.0 years remaining

Inverse calculation apparatus and recording medium having stored thereon a program for executing inverse calculation

Assignee: NTT Inc
•
Filing: 2003-04-21
•
Granted: 2005-02-01
•
Expires: 2023-04-21
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In an inverse calculation, x is road out of a storage means, [x/2] is calculated and stored therein as b, a lent significant bit of b is stored as a, [(ax+b)/2] is calculated and stored as updated b, and low-order two bits of x are stored as y. Then, for i=1, 2, . . . , n−1, by is calculated, a is updated with −by, [(b+ax)/(2^(2 i ))] is calculated and stored as updated b, and y+a2^(2 i ) is calculated and stored as updated y, where y is road out as the result of inverse calculation.

Inventors

  • 👤 Kazumaro Aoki
  • 👤 Hiroki Ueda
  • 👤 Masayuki Kanda

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 16:39
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/60; G06F7/72; G06F7/721; H; H04; H04L; H04L9/00; H04L9/06; H04L9/0618; H04L9/0625; G06F7/724; G06F7/726; G06F7/728; H04L2209/00; H04L2209/04; H04L2209/046; H04L2209/12; H04L2209/122

Claims Analysis

Total Claims: 4
Claim 1
Independent Claim 321 words
An inverse calculating apparatus comprising: input means for storing an input x in storage means; storage means for staring integers n and i and 2 n -bit integer x, y, a and b, where said integers n and i are equal to or greater than 1; first b-initializing means for calculating [x/2] using said x stored in said storage means and storing the calculation result as said b in said storage means, where [x] is the maximum integer not exceeding x; a-initializing means for storing the least significant bit of said b as a in said storage means; second b-initializing means for calculating [(ax+b)/2] using said a, x and b stored in said storage means and updating said b stored in said storage means with the calculation result; y-initializing means for acquiring low-order two bits of said x stored in said storage means and storing them as said y in said storage means; i-initializing means for setting said i in said storage means to 1; a-updating for calculating −by using said b and y stored in said storage means and updating said a stored in said storage means with the calculation result; b-updating means for calculating [(b+ax)/(2^(2 i ))] using said a, b, x and i stored in said storage means and updating said b stored in said storage means with the calculation result, where p^q represents the q-th power of p; y-updating means for calculating y+ax2^(2 i ) using said a, y and i stored in said storage means and updating said y stored in said storage means with the calculation result; i-updating means for updating said i stored in said storage means to i+1; control means for reading out said i and n from said storage means and actuating said a-updating means, said b-updating means, said y-updating means and said i-updating means one after another until i=n; and output means for outputting said y stored in said storage means.
Claim 2
Dependent Claim 321 words
An inverse calculating apparatus comprising: input means for storing an input x in storage means; storage means for staring integers n and i and 2 n -bit integer x, y, a and b, where said integers n and i are equal to or greater than 1; first b-initializing means for calculating [x/2] using said x stored in said storage means and storing the calculation result as said b in said storage means, where [x] is the maximum integer not exceeding x; a-initializing means for storing the least significant bit of said b as a in said storage means; second b-initializing means for calculating [(ax+b)/2] using said a, x and b stored in said storage means and updating said b stored in said storage means with the calculation result; y-initializing means for acquiring low-order two bits of said x stored in said storage means and storing them as said y in said storage means; i-initializing means for setting said i in said storage means to 1; a-updating for calculating −by using said b and y stored in said storage means and updating said a stored in said storage means with the calculation result; b-updating means for calculating [(b+ax)/(2^(2 i ))] using said a, b, x and i stored in said storage means and updating said b stored in said storage means with the calculation result, where p^q represents the q-th power of p; y-updating means for calculating y+ax2^(2 i ) using said a, y and i stored in said storage means and updating said y stored in said storage means with the calculation result; i-updating means for updating said i stored in said storage means to i+1; control means for reading out said i and n from said storage means and actuating said a-updating means, said b-updating means, said y-updating means and said i-updating means one after another until i=n; and output means for outputting said y stored in said storage means.
Claim 3
Dependent Claim 335 words
A recording medium having recorded thereon a program for the execution by a computer of an inverse calculating apparatus, said program comprising the steps of: (a) storing an input 2 n -bit integer x in storage means, n being an integer equal to or greater than 1; (b) reading out said x from said storage means, calculating [x/2] and storing the calculation result as a 2 n -bit integer b in said storage means, where [x] is the maximum integer not exceeding x; (c) reading out said b from said storage means and storing the least significant bit of said b as a 2 n -bit integer a in said storage means; (d) reading out said a, x and b from said storage means, calculating [(ax+b)/2], and storing the calculation result as said b in said storage means; (e) reading out said x from said storage means, acquiring low-order two bits of said x, and storing said low-order two bits as a 2 n -bit integer y in said storage means; (f) initializing an integer i to 1 and storing it in said storage means; (g) reading out said b and y from said storage means, calculating −by, and updating said a stored in said storage means with the calculation result; (h) reading out said a, b, x and i from said storage means, calculating [(b+ax)/(2^(2 i ))], and updating said b stored in said storage means with the calculation result, p^q representing the q-th power of p; (i) reading out said a, y and i from said storage means) calculating y+ax2^(2 i ), and updating said y stored in said storage means with the calculation result; (j) reading out said i from said storage means and updating said i to i+1; (k) reading out said i and n from said storage means and performing said a-updating step, said b-updating step, said y-updating step and said i-updating step one after another until i=n; and (l) reading out said y from said storage means for output.
Claim 4
Dependent Claim 335 words
A recording medium having recorded thereon a program for the execution by a computer of an inverse calculating apparatus, said program comprising the steps of: (a) storing an input 2 n -bit integer x in storage means, n being an integer equal to or greater than 1; (b) reading out said x from said storage means, calculating [x/2] and storing the calculation result as a 2 n -bit integer b in said storage means, where [x] is the maximum integer not exceeding x; (c) reading out said b from said storage means and storing the least significant bit of said b as a 2 n -bit integer a in said storage means; (d) reading out said a, x and b from said storage means, calculating [(ax+b)/2], and storing the calculation result as said b in said storage means; (e) reading out said x from said storage means, acquiring low-order two bits of said x, and storing said low-order two bits as a 2 n -bit integer y in said storage means; (f) initializing an integer i to 1 and storing it in said storage means; (g) reading out said b and y from said storage means, calculating −by, and updating said a stored in said storage means with the calculation result; (h) reading out said a, b, x and i from said storage means, calculating [(b+ax)/(2^(2 i ))], and updating said b stored in said storage means with the calculation result, p^q representing the q-th power of p; (i) reading out said a, y and i from said storage means) calculating y+ax2^(2 i ), and updating said y stored in said storage means with the calculation result; (j) reading out said i from said storage means and updating said i to i+1; (k) reading out said i and n from said storage means and performing said a-updating step, said b-updating step, said y-updating step and said i-updating step one after another until i=n; and (l) reading out said y from said storage means for output.

References Cited (Backward Citations)

JPS60167062A Cited
US5539827A Cited
US5519647A Cited
JPH1171255A Cited
US5687238A Cited
US5825886A Cited
US6298136B1 Cited
US5928310A Cited
US6408075B1 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2008-02-01 2008-08-02 2009-02-01 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2012-02-01 2012-08-02 2013-02-01 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2016-02-01 2016-08-02 2017-02-01 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag