Finite Precision Number Systems and Arithmetic

@inproceedings{Kornerup2010FinitePN,
  title={Finite Precision Number Systems and Arithmetic},
  author={Peter Kornerup and David W. Matula},
  year={2010}
}
Fundamental arithmetic operations support virtually all of the engineering, scientific, and financial computations required for practical applications, from cryptography, to financial planning, to rocket science. This comprehensive reference provides researchers with the thorough understanding of number representations that is a necessary foundation for designing efficient arithmetic algorithms. Using the elementary foundations of radix number systems as a basis for arithmetic, the authors… 
Mathematical model and implementation of rational processing
Exact Real Algorithms for Transcendent Functions
  • P. Kurka
  • Computer Science
    2016 3rd International Conference on Information Science and Control Engineering (ICISCE)
  • 2016
TLDR
The exact real computation is therefore a feasible alternative to the floating point computation, at least in the tasks, in which the precision of the results matters.
A FIXED-POINT DIGIT SERIAL SQUARING ALGORITHM USING AN ARBITRARY NUMBER SYSTEM
TLDR
The algorithm is derived through a generalization of a Vedic technique where any arbitrary integer-valued radix is used and where no constraints are imposed upon the value of the least significant digit of the squarand.
Parallel Implementation of Exact Matrix Computation Using Multiple P-adic Arithmetic
  • Xinkai LiChao LuJ. A. Sjogren
  • Mathematics, Computer Science
    2013 14th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing
  • 2013
TLDR
Progress is reported on parallel implementation of P-adic arithmetic by means of a multiple modulus rational system related to the Chinese remainder theorem.
New Formats for Computing with Real-Numbers under Round-to-Nearest
In this paper, a new family of formats to deal with real number for applications requiring round to nearest is proposed. They are based on shifting the set of exactly represented numbers which are
The Exact Real Arithmetical Algorithm in Binary Continued Fractions
  • P. Kurka
  • Computer Science
    2015 IEEE 22nd Symposium on Computer Arithmetic
  • 2015
TLDR
This work considers a number system of binary continued fractions in which this algorithm is computed faster than in the binary signed system, and circumvents the problem of nonredundancy and slow convergence of continued fractions.
Reviewing High-Radix Signed-Digit Adders
TLDR
It is shown that there are no speed advantages in recoding the addends into a higher radix if the radix is a power of 2, but there are significant savings in using standard 4-to-2 adders, even saving half of the operations in multi-operand addition.
Multiplicative Division Employing Independent Factors
TLDR
Specific derivations of the method for IEEE-754 standard binary single and double precision division are developed in detail, and theoretical error bounds are derived to prove correctness for obtaining properly rounded single precision quotients by rounding the product of these four factors.
A Fixed-Point Squaring Algorithm Using an Implicit Arbitrary Radix Number System
TLDR
The squarer presented here can be considered a multiple-valued logic (MVL) digit-serial architecture and allows for technologies based on any radix of two or greater to be used, including emerging technologies, thus yielding a true multiple- valued logic squaring circuit.
Implementation of Novel High Radix Multiplier Using KOGGE Stone Adder
TLDR
It is shown that there are no speed advantages in recoding the addends into a higher radix if the radix is a power of 2, but there are significant savings in using standard 4-to-2 adders, even saving half of the operations in multi-operand addition.
...
...