Patent Application Number: 2005218001
Filing Date: September 28, 2005Priority Date: October 28, 2004
Inventors: Cyrille de Brebisson
Applicants: Hewlett-Packard Development
View Prior Art for Claim 6
A method of converting a number represented in binary form and comprised of more than one segment to a decimal representation, the method comprising the steps of:
combining a first decimal segment resulting from converting a segment of the more than one binary segments to decimal form with a second decimal segment resulting from converting another segment of the more than one binary segment to decimal form, wherein the segment size is determined based on processor word size.
Title IBM UK Ltd., UK
Description
identical algorithm
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."
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.
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
United States