Efficient error-check and exact-check for Newton-Raphson...

Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C708S510000, C708S605000, C708S654000

Reexamination Certificate

active

07899859

ABSTRACT:
One embodiment of the present invention provides a system that performs both error-check and exact-check operations for a Newton-Raphson divide or square-root computation. During operation, the system performs Newton-Raphson iterations followed by a multiply for a divide or a square-root operation to produce a result, which includes one or more additional bits of accuracy beyond a desired accuracy for the result. Next, the system rounds the result to the desired accuracy to produce a rounded result t. The system then analyzes the additional bits of accuracy to determine whether t is correct and whether t is exact.

REFERENCES:
patent: 5563818 (1996-10-01), Agarwal et al.
patent: 5956263 (1999-09-01), Narita et al.
patent: 6115733 (2000-09-01), Oberman et al.
patent: 6941334 (2005-09-01), Rogenmoser et al.
patent: 2002/0198918 (2002-12-01), Steele, Jr.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Efficient error-check and exact-check for Newton-Raphson... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient error-check and exact-check for Newton-Raphson..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient error-check and exact-check for Newton-Raphson... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2770196

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.