Results 251 to 260 of about 641,208 (284)
Some of the next articles are maybe not open access.
Customising floating-point designs
Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 2003This paper describes a method for customising the representation of floating-point numbers that exploits the flexibility of reconfigurable hardware. The method determines the appropriate size of mantissa and exponent for each operation in a design, so that a cost function with a given error specification for the output relative to a reference ...
Altaf Abdul Gaffar +3 more
openaire +1 more source
Mathematics and Computers in Simulation, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Handling of floating point exceptions
Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software on -, 1978An IEEE subcommittee on the standardization of microprocessor floating point arithmetic has a proposal under discussion. Part of that proposal concerns overflow and underflow exceptions. The proposal calls for a “gradual” underflow implemented with demoralized numbers.
Thomas W. Eggers +2 more
openaire +1 more source
Multiplications of floating point expansions
Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336), 2003In modern computers, the floating point unit is the part of the processor delivering the highest computing power and getting most attention from the design team. Performance of any multiple precision application will be dramatically enhanced by adequate use of floating point expansions.
openaire +1 more source
Software: Practice and Experience, 1991
AbstractA floating‐point‐number‐oriented LISP has been developed. Though it performs type checking on every numeric operation, it runs as fast as Fortran for simple differential‐equation problems. This paper describes the implementation, provides some measurements of its efficiency, and discusses the feasibility of this type of implementation.
openaire +1 more source
AbstractA floating‐point‐number‐oriented LISP has been developed. Though it performs type checking on every numeric operation, it runs as fast as Fortran for simple differential‐equation problems. This paper describes the implementation, provides some measurements of its efficiency, and discusses the feasibility of this type of implementation.
openaire +1 more source
Preprints of papers presented at the 14th national meeting of the Association for Computing Machinery on - ACM '59, 1959
In many floating point calculations it is important to arrange the sequence of calculations such that significant digits are not deleted by intermediate rounding of the numbers. The danger that gross errors may be introduced is always present in floating point calculations, since the number of digits carried in each number is restricted in normal ...
openaire +1 more source
In many floating point calculations it is important to arrange the sequence of calculations such that significant digits are not deleted by intermediate rounding of the numbers. The danger that gross errors may be introduced is always present in floating point calculations, since the number of digits carried in each number is restricted in normal ...
openaire +1 more source
A Binary Floating-Point Resistor
IEEE Transactions on Computers, 1971The digital computer control of physical processes requires parameters that can be altered digitally. A resistor design is described that provides settings in a wide range with fixed precision. For this purpose a binary floating-point format is used both for expressing the resistor values and for the digital setting.
openaire +1 more source
A FPGA Floating Point Interpolator
2013The fuzzy-interpolative systems, a class of the Sugeno family fuzzy controllers, merge the linguistic representation of the knowledge with the effective interpolative implementations. Their application is immediate in any possible software environment, by look-up-table structures. However, their hardware implementation is not so easy.
Marius M. Balas +2 more
openaire +1 more source