<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>Prior Art submitted for Binary representation of number based on processor word size</title>
    <link>http://www.peertopatent.org.au/patent/11/prior_art/list</link>
    <description>A method of converting a number to a binary representation based on a processor word size is described. In accordance with the method, a predetermined size segment of a number is converted to a binary representation wherein the predetermined size segment is based on the processor word size. Also described is a method of converting a number represented in binary form and comprised of more than one segment, wherein the segment size is determined based on processor word size, to a decimal representation. A first decimal segment resulting from converting a segment of the more than one binary segments to decimal form is combined with a second decimal segment resulting from converting another segment of the more than one binary segments to decimal form.</description>
    <language>en-us</language>
    <item>
      <title>Knuth, Seminumerical Algorithms</title>
      <category>Binary representation of number based on processor word size</category>
      <description>Title: The Art of Computer Programming, Volume 2, Seminumerical Algorithms&lt;br/&gt;ISBN: 0-201-03822-6&lt;br/&gt;Description: Knuth's famous series includes a chapter on multiprecision arithmetic including the use of base 10**n big digits</description>
      <pubDate>Wed, 24 Feb 2010 12:48:27 +1000</pubDate>
      <guid>http://www.peertopatent.org.au/prior_art/43/detail</guid>
    </item>
    <item>
      <title>DEC-10 Prolog library</title>
      <category>Binary representation of number based on processor word size</category>
      <description>Name/Title: long.pl (in DEC-10 Prolog library)&lt;br/&gt;System Type: Code Library, Module, Plug-in, Component, or Function&lt;br/&gt;Description: The DEC-10 Prolog library provided base 10**N bignums in the file LONG.PL in 1981.</description>
      <pubDate>Wed, 24 Feb 2010 12:24:28 +1000</pubDate>
      <guid>http://www.peertopatent.org.au/prior_art/42/detail</guid>
    </item>
    <item>
      <title>GNU GMP 2.0.X</title>
      <category>Binary representation of number based on processor word size</category>
      <description>Name/Title: GNU GMP 2.0.2&lt;br/&gt;System Type: Code Library, Module, Plug-in, Component, or Function&lt;br/&gt;Description: GNU Multiple Precision Arithmetic Library. &amp;quot;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.&amp;quot;</description>
      <pubDate>Thu, 10 Dec 2009 23:33:02 +1000</pubDate>
      <guid>http://www.peertopatent.org.au/prior_art/3/detail</guid>
    </item>
    <item>
      <title>Densely packed decimal encoding</title>
      <category>Binary representation of number based on processor word size</category>
      <description>Title: IBM UK Ltd., UK&lt;br/&gt;Description: identical algorithm</description>
      <pubDate>Thu, 10 Dec 2009 08:45:10 +1000</pubDate>
      <guid>http://www.peertopatent.org.au/prior_art/1/detail</guid>
    </item>
  </channel>
</rss>

