𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Probabilistic analysis of floating-point addition

✍ Scribed by A. I. Mikov

Publisher
Springer US
Year
1984
Tongue
English
Weight
694 KB
Volume
19
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Reducing the mean latency of floating-po
Reducing the mean latency of floating-point addition
✍ Stuart F. Oberman; Michael J. Flynn πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 866 KB

Addition is the most frequent floating-point operation in modem microprocessors. Due to its complex shift-add-shift-round data flow, floating-point addition can have a long latency. To achieve maximum system performance, it is necessary to design the floating-point adder to have minimum latency, wh

A floating point multiplier performing I
A floating point multiplier performing IEEE rounding and addition in parallel
✍ Woo-Chan Park; Tack-Don Han; Shin-Dug Kim; Sung-Bong Yang πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 236 KB

In the conventional Β―oating point multipliers, the rounding stage is usually constructed by using a high speed adder for the increment operation, increasing the overall execution time and occupying a large amount of chip area. Furthermore, it may accompany additional execution time and hardware comp

Lossless compression of predicted floati
Lossless compression of predicted floating-point geometry
✍ Martin Isenburg; Peter Lindstrom; Jack Snoeyink πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 582 KB

The size of geometric data sets in scientific and industrial applications is constantly increasing. Storing surface or volume meshes in standard uncompressed formats results in large files that are expensive to store and slow to load and transmit. Scientists and engineers often refrain from using me