We investigate two sets of hard to round p/spl times/p bit fractions arising from division of a normalized p bit floating point dividend by a normalized p ...

Finding such a hard to round fraction directly identifies an input dividcnd and divisor pair for inclusion in a division test suite. In Scction 3 we employ and ...

Abstract: We investigate two sets of hard to round p\times p bit fractions arising from division of a normalized p bit floating point dividend by a ...

Generation and analysis of hard to round cases for binary floating point division · L. McFearin, D. Matula · Published in Proceedings 15th IEEE… 11 June 2001 ...

Generation and analysis of hard to round cases for binary floating point division. McFearin L.D., Matula D.W.. Expand. Publication type: Proceedings Article.

Generation and Analysis of Hard to Round Cases for Binary Floating Point Division. Conference Paper. Jan 2001. Lee D. McFearin · David W. Matula. We investigate ...

Abstract: We investigate two sets of hard to round p\times p bit fractions arising from division of a normalized p bit floating point dividend by a normalized p ...

We determine properties of these extremal rounding boundary sets RN p , RD p , and describe their use in the testing of floating point division implementations.

Generation and Analysis of Hard to Round Cases for Binary Floating Point Division pp. 0119. Some Improvements on Multipartite Table Methods pp. 0128. High ...

This simplifies code development, especially portable code development, as well as some important rounding error analyses, as we will illustrate below.