Results 171 to 180 of about 403 (212)
Some of the next articles are maybe not open access.
Axiomatizations of floating point arithmetics
1985 IEEE 7th Symposium on Computer Arithmetic (ARITH), 1985We 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 +2 more sources
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
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, 1989Considerations 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 +3 more
openaire +1 more source
2016
Integers are represented on a computer in the form of signed binary numbers. Often 2-, 4- and 8-byte integers are available where a byte possesses eight binary digits. In many computers 4 bytes are the smallest available—addressable—unit of the memory. It may turn out that we can work with one- and 16-byte integers, too.
Gisbert Stoyan, Agnes Baran
openaire +1 more source
Integers are represented on a computer in the form of signed binary numbers. Often 2-, 4- and 8-byte integers are available where a byte possesses eight binary digits. In many computers 4 bytes are the smallest available—addressable—unit of the memory. It may turn out that we can work with one- and 16-byte integers, too.
Gisbert Stoyan, Agnes Baran
openaire +1 more source
Floating-point on-line arithmetic: Algorithms
1981 IEEE 5th Symposium on Computer Arithmetic (ARITH), 1981For 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
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 +2 more
openaire +1 more source
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 +2 more
openaire +1 more source
Parameterised floating-point arithmetic on FPGAs
2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221), 2002This paper describes the parameterisation, implementation and evaluation of floating-point adders and multipliers for FPGAs. We have developed a method, based on the Handel-C language, for producing technology-independent pipelined designs that allow compile-time parameterisation of design precision and range, and optional inclusion of features such as
Allan Jaenicke, Wayne Luk
openaire +2 more sources
An IEEE floating point arithmetic implementation
1983 IEEE 6th Symposium on Computer Arithmetic (ARITH), 1983This article describes some of the methods and algorithms used in an implementation of floating point arithmetic following (almost) the IEEE standard defined in (1). The description is more directly algorithm-oriented than the ‘Implementation Guide’ for this standard (2), since the latter does not treat an actual implementation.
openaire +2 more sources
Required scientific floating point arithmetic
1978 IEEE 4th Symposium onomputer Arithmetic (ARITH), 1978Previous papers in computer arithmetic have shown that correct rounded floating point with good arithmetic properties can be attained using guard digits and careful algorithms on the floating point fractions. This paper combines that body of knowledge with proposed exponent forms that are closed with respect to inversion and detection and recovery of ...
openaire +2 more sources
On Local Roundoff Errors in Floating-Point Arithmetic
Journal of the ACM, 1973A bound on the relative error in floating-point addition using a single-precision accumulator with guard digits is derived. It is shown that even with a single guard digit, the accuracy can be almost as good as that using a double-precision accumulator.
Toyohisa Kaneko, Bede Liu
openaire +3 more sources