Results 251 to 260 of about 7,246 (295)

Unnormalized Floating Point Arithmetic

Journal of the ACM, 1959
Algorithms for floating point computer arithmetic are described, in which fractional parts are not subject to the usual normalization convention. These algorithms give results in a form which furnishes some indication of their degree of precision. An analysis of one-stage error propagation is developed for each operation; a suggested statistical model ...
Robert L. Ashenhurst, Nicholas C. Metropolis   +1 more
openaire   +2 more sources

A Hierarchical Block-Floating-Point Arithmetic

Journal of VLSI signal processing systems for signal, image and video technology, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shiro Kobayashi, Gerhard P. Fettweis
openaire   +2 more sources

Roundings in floating point arithmetic

1972 IEEE 2nd Symposium on Computer Arithmetic (ARITH), 1972
In this paper we discuss directed roundings and indicate how hardware might be designed to produce proper upward-directed, downward-directed, and certain commonly used symmetric roundings. Algorithms for the four binary arithmetic operations and for rounding are presented, together with proofs of their correctness; appropriate formulas for a priori ...
openaire   +1 more source

Computing correctly rounded integer powers in floating-point arithmetic

ACM Transactions on Mathematical Software, 2010
International audienceWe introduce several algorithms for accurately evaluating powers to a positive integer in floating-point arithmetic, assuming a fused multiply-add (fma) instruction is available.
Peter Kornerup, Christoph Lauter, Jean-Michel Müller   +2 more
exaly   +2 more sources

Floating-Point Arithmetics

Journal of the ACM, 1960
Three types of floating-point arithmetics with error control are discussed and compared with conventional floating-point arithmetic. General multiplication and division shift criteria are derived (for any base) for Metropolis-type arithmetics. The limitations and most suitable range of application for each arithmetic are discussed.
openaire   +1 more source

Axiomatizations of floating point arithmetics

1985 IEEE 7th Symposium on Computer Arithmetic (ARITH), 1985
We present a universal scheme for axiomatizing floating point ariththmetic. The schema can be used to axiomatize any floating point arithmetic. It consists of a labeled graph with vertices describing some arithmetical properties and edges containing appropriate axioms. The language of floating point arithmetic is developed gradually in this scheme. The
openaire   +1 more source

Floating Point Arithmetic

Microprocessors and Microsystems, 1979
So far all the binary numbers considered have been integers with a maximum of 16 bits. Thus it has only been possible to represent numbers in the range Open image in new window or Open image in new ...
openaire   +2 more sources

Floating Point Arithmetic in Future Supercomputers

The International Journal of Supercomputing Applications, 1989
Considerations in the floating-point design of a supercomputer are discussed. Particular attention is given to word size, hardware support for extended precision, format, and accuracy characteristics. These issues are discussed from the perspective of the Numerical Aerodynamic Simulation Systems Division at NASA Ames.
David H. Bailey, Horst D. Simon, John T. Barton, Martin J. Fouts   +3 more
openaire   +1 more source

Floating-point on-line arithmetic: Algorithms

1981 IEEE 5th Symposium on Computer Arithmetic (ARITH), 1981
For effective application of on-line arithmetic to practical numerical problems, floating-point algorithms for on-line addition/subtraction and multiplication have been implemented by introducing the notion of quasi-normalization. Those proposed are normalized fixed-precision FLPOL (floating-point on-line) algorithms.
Osaaki Watanuki, Milos D. Ercegovac
openaire   +1 more source

Floating Point Arithmetic

2012
There are many data processing applications (e.g. image and voice processing), which use a large range of values and that need a relatively high precision. In such cases, instead of encoding the information in the form of integers or fixed-point numbers, an alternative solution is a floating-point representation.
Jean-Pierre Deschamps, Gustavo D. Sutter, Enrique Cantó   +2 more
openaire   +1 more source