Computer arithmetic algorithms
By Israel Koren. 2018
1,339 citations recorded by the source corpus.
An explanation of the principles of the algorithms available for performing arithmetic operations in digital computers. The algorithms are described independently of specific implementation technology and within the same framework, so that similarities between algorithms become evident.
Subfields: Computational Theory and Mathematics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/e3d0a6d7b613ca4940d328d33fa3f71f9475d08a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Zhaohui Fu
- Scott A. Vanstone
- Sharad Malik
- Alfred J. Menezes
- Milos D. Ercegovac
- Parag Kulkarni
- Puneet Gupta
- Jessica Davies
In Numerical Analysis
- Scott A. Vanstone
- Sharad Malik
- Alfred J. Menezes
- Milos D. Ercegovac
- Parag Kulkarni
- Puneet Gupta
- Zhaohui Fu
Citations in the corpus
- Trading Accuracy for Power with an Underdesigned Multiplier Architecture (2011, methodology): “Larger multipliers are built by using the inaccurate 2x2 block to produce partial products and then adding the shifted partial products [16].”
- Handbook of Applied Cryptography (2018, background): “Representing and manipulating negative numbers is an important topic; for an introduction, consult the book by Koren [706].”
- On Solving the Partial MAX-SAT Problem (2006, methodology): “We use an auxiliary logic counter [11] to represent this ≤ k condition, whose output is a Boolean variable and the entire counter could then be translated into CNF in a straightforward way.”