decoration decoration
Stories

GROKLAW
When you want to know more...
decoration
For layout only
Home
Archives
Site Map
Search
About Groklaw
Awards
Legal Research
Timelines
ApplevSamsung
ApplevSamsung p.2
ArchiveExplorer
Autozone
Bilski
Cases
Cast: Lawyers
Comes v. MS
Contracts/Documents
Courts
DRM
Gordon v MS
GPL
Grokdoc
HTML How To
IPI v RH
IV v. Google
Legal Docs
Lodsys
MS Litigations
MSvB&N
News Picks
Novell v. MS
Novell-MS Deal
ODF/OOXML
OOXML Appeals
OraclevGoogle
Patents
ProjectMonterey
Psystar
Quote Database
Red Hat v SCO
Salus Book
SCEA v Hotz
SCO Appeals
SCO Bankruptcy
SCO Financials
SCO Overview
SCO v IBM
SCO v Novell
SCO:Soup2Nuts
SCOsource
Sean Daly
Software Patents
Switch to Linux
Transcripts
Unix Books

Gear

Groklaw Gear

Click here to send an email to the editor of this weblog.


You won't find me on Facebook


Donate

Donate Paypal


No Legal Advice

The information on Groklaw is not intended to constitute legal advice. While Mark is a lawyer and he has asked other lawyers and law students to contribute articles, all of these articles are offered to help educate, not to provide specific legal advice. They are not your lawyers.

Here's Groklaw's comments policy.


What's New

STORIES
No new stories

COMMENTS last 48 hrs
No new comments


Sponsors

Hosting:
hosted by ibiblio

On servers donated to ibiblio by AMD.

Webmaster
About binary representations | 661 comments | Create New Account
Comments belong to whoever posts them. Please notify us of inappropriate comments.
About binary representations
Authored by: Anonymous on Friday, March 29 2013 @ 01:18 PM EDT
Ah, yes, all that you say is true (and obvious to anyone who's ever done
assembly-language floating-point arithmetic.)

All the machines that I have any information about, have floating-point
registers that are as long or longer than the in-memory representation. With the
IEEE standard, this practice is

Which means -- in real practice, NOBODY builds a machine that PRACTICES or
INFRINGES this patent. And, since software simply uses the machine instructions,
it's not possible for software to infringe the patent (unless, of course,
someone was idiotic enough to implement this algorithm in slow software rather
than using the hardware...)

And finally, this algorithm is brain-dead from the beginning. Some legal-weasel
doofus may say it's an "improvement" over IEEE-standard arithmetic to
round the operands first -- but some legal-weevil legislator could just as
accurately, just as usefully, just as intelligently, propose a law saying that
the value of pi should be 3 for all future ages.

There's no reason at all to round the operands first, and many good reasons not
to.

But what would I know? I'm not a patent lawyer, just a graduate of
BS/mathematics, MS/computer science university programs.

[ Reply to This | Parent | # ]

Yup.
Authored by: jesse on Saturday, March 30 2013 @ 05:53 AM EDT
In my case, the multiply by 100 was necessary to force the conversion to the
correct resolution - as I recall it was a truncate conversion. This was a
business simulation application, and converted from IBM 360/370 Fortran to run
on a Dec System 10. So there was also a required floating point format
differences got involved.

You also get normalized/unnormalized results when using IEEE floating point
causing additional uncertainty. As I recall, the internal register formats were
allowed to be unnormalized - which improves speed, but can introduce more errors
when used in certain operations/other values. This was the original intent to
have up to 80 bits of precision inside the FPU to reduce these errors.

[ Reply to This | Parent | # ]

Groklaw © Copyright 2003-2013 Pamela Jones.
All trademarks and copyrights on this page are owned by their respective owners.
Comments are owned by the individual posters.

PJ's articles are licensed under a Creative Commons License. ( Details )