Computer arithmetic algorithms.
From MaRDI portal
Recommendations
Cited in
(45)- Incremental column-wise verification of arithmetic circuits using computer algebra
- “Logical” arithmetic on computers with two's complement binary arithmetic
- Arithmetic Algorithms in a Negative Base
- Inside your calculator. From simple programs to significant insights.
- An efficient universal addition scheme for all hybrid-redundant representations with weighted bit-set encoding
- Reciprocal and reciprocal square root units with operand modification and multiplication
- On the Possibility of Increasing the Accuracy of Computations in the Floating-Point Format with Multiple Exponents
- Precise numerical computation
- Fast exponentiation by folding the signed-digit exponent in half
- Functional verification of high performance adders in \textsc{Coq}
- Efficient CRT-based residue-to-binary converter for the arbitrary moduli set
- scientific article; zbMATH DE number 3992805 (Why is no real title available?)
- Correction to “logical” arithmetric on computers with two's complement binary arithmetic
- scientific article; zbMATH DE number 48134 (Why is no real title available?)
- scientific article; zbMATH DE number 50839 (Why is no real title available?)
- scientific article; zbMATH DE number 3874603 (Why is no real title available?)
- Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
- Rethinking arithmetic for deep neural networks
- Computer arithmetic and validity. Theory, implementation, and applications
- An efficient parity detection technique using the two-moduli set \(\{2^{h} - 1, 2^{h} + 1\}\)
- An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
- Efficient realization of large size two's complement multipliers using embedded blocks in FPGAs
- An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
- Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem
- Regular numeral systems for data structures
- Modern computer arithmetic
- Balanced non-adjacent forms
- Constant-time sorting
- Arithmetic and Logic in Computer Systems
- Fast modular multi-exponentiation using modified complex arithmetic
- Formal proof of prefix adders
- scientific article; zbMATH DE number 605662 (Why is no real title available?)
- Computer arithmetic. Volume III
- GenMul: Generating Architecturally Complex Multipliers to Challenge Formal Verification Tools
- An optimized quantum circuit for converting from sign-magnitude to two's complement
- An improved Chen's parity detection technique for the two-moduli set
- Formal proof of integer adders using all-prefix-sums operation
- Computer-hardware evaluation of mathematical functions
- Guest editors' introduction: Special section on computer arithmetic
- scientific article; zbMATH DE number 3938520 (Why is no real title available?)
- scientific article; zbMATH DE number 603361 (Why is no real title available?)
- Computer arithmetic. Algorithms and hardware implementations.
- scientific article; zbMATH DE number 3749094 (Why is no real title available?)
- scientific article; zbMATH DE number 4117837 (Why is no real title available?)
- Novel quantum compressor designs using new genetic algorithm-based simulator, analyzer and synthesizer software in nanotechnology
This page was built for publication: Computer arithmetic algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2773752)
