On Tue, 18 Feb 2025 13:07:39 +0000, Michael S wrote:With discrete logic, it should be identical to RNE, except for flipping the ulp bit when deciding upon the rounding direction, right?
On Tue, 18 Feb 2025 02:55:33 +0000No, No
mitchalsup@aol.com (MitchAlsup1) wrote:>>
It takes Round Nearest Odd to perform Kahan-Babashuka Summation.
>
Are you aware of any widespread hardware that supplies Round to Nearest
with tie broken to Odd? Or of any widespread language that can request
such rounding mode?
Until both, implementing RNO on niche HW looks to me as wastage of bothThey way I implement it, it is only an additional 10± gates.
HW resources and of space in your datasheet.
With a full 4-bit lookup table you need a few more gates, but that is still the obvious way to implement rounding in SW. (It is only ceil() and floor() that requires the sign bit as input, the remaining rounding modes can make do with ulp+guard+sticky.
Terje
--
- <Terje.Mathisen at tmsw.no>
"almost all programming can be viewed as an exercise in caching"
| Date | Sujet | # | Auteur | |
| 3 Feb 25 |  Re: Cost of handling misaligned access | 106 | Anton Ertl |
Les messages affichés proviennent d'usenet.