Access the full text.
Sign up today, get DeepDyve free for 14 days.
i N E ugh for 2. The Simple Case 8-])iglit k c : racy [, I~ldNNI';T'J ('~(HA)I'IEI((} :~: We can represent each of the 90 decimal integers 10, 11, .-. , 98, 99 by the equivalent 7-bit integer, with no question regarding accuracy, as follows: (/+:/,ergd /(/cog:i:: (',rope*l,+/, (/~+w,b?'id(/~:,Masa. From the inequality 1 0 ~ < 2:, we are likely to conclude that we can represent 8-digit decimal floating-point numbers accurately by 27-bit floating~point numbers. However, we need 28 significant bits to represent some 8-digit numbers accurately. In general, we can show that if 10 ~' < 2 q ', then q significant bits are always enough for p-digit decimal accuracy. Finally, we can define a compact 27-blt floating-point representation that will give 28 significant bits, for numbers of practical importance. We can represent each of the 90 decimal fractions .10, .11, . . . , .98, .99 represented by the approximate binary fraction rounded to 7 [)Faces: .10 .11 .12 . 0 0 0 1 1 0 1 . 0 0 0 1 1 1 0 . 0 0 0 1 1 1 1 . 1 1 1 1 1 0 0 , 1 1 1 1
Communications of the ACM – Association for Computing Machinery
Published: Feb 1, 1967
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.