Peer-to-Patent Australia

View Prior Art for Claim 5

The method of claim 1, wherein the number in binary form is larger than a single processor word.

#1Densely packed decimal encoding

Applies to Claims 1,10,2,3,4,5,6,7,8,9

Submitted by: Graham MenhennittLast updated: over 2 years ago

Title IBM UK Ltd., UK

Description

identical algorithm

0 thumbs up 0 thumbs down

View Full Prior Art >

Annotations(0)

#3GNU GMP 2.0.X

Applies to Claims 1,10,11,12,2,5,6,7,8,9

Submitted by: Paul LeopardiLast updated: over 2 years ago

Name/Title GNU GMP 2.0.2

System Type Code Library, Module, Plug-in, Component, or Function

Description

GNU Multiple Precision Arithmetic Library. "GMP is a free library for arbitrary precision arithmetic, operating on signed integers, rational numbers, and floating point numbers. ... The first GMP release was made in 1991."

1 thumb up 0 thumbs down

View Full Prior Art >

Annotations(1)

#42DEC-10 Prolog library

Applies to Claims 1,10,11,12,2,5,6,7,9

Submitted by: Richard O'KeefeLast updated: about 1 year ago

Name/Title long.pl (in DEC-10 Prolog library)

System Type Code Library, Module, Plug-in, Component, or Function

Description

The DEC-10 Prolog library provided base 10**N bignums in the file LONG.PL in 1981.

0 thumbs up 0 thumbs down

View Full Prior Art >

Annotations(0)

#43Knuth, Seminumerical Algorithms

Applies to Claims 1,2,3,5,6,7

Submitted by: Richard O'KeefeLast updated: about 1 year ago

Title The Art of Computer Programming, Volume 2, Seminumerical Algorithms

ISBN 0-201-03822-6

Description

Knuth's famous series includes a chapter on multiprecision arithmetic including the use of base 10**n big digits

0 thumbs up 0 thumbs down

View Full Prior Art >

Annotations(0)