scientific article; zbMATH DE number 3974160
[For the entire collection see Zbl 0583.00003.] We detail an algorithm for performing multiple precision digital division. Like the other arithmetic operations (and unlike all other division algorithms) we perform the division operation on operands \(a=(a_ 0a_ 1a_ 2...a_ m)=\sum^{m}_{i=0}a_ i\rho^{m-i}\) and \(b=(b_ 0b_ 1b_ 2...b_ n)=\sum^{n}_{i=0}b_ i\rho^{n- i};\) \(m\geq n\), radix \(\rho\), where \(a_ 0>0\), \(b_ 0>0\); by applying division to individual operand digit pairs \(a_ i,b_ i\). The algorithm is self-correcting and calculates quotient digits which are either correct or too large by 1.
- Efficient multiple-precision integer division algorithm
- Easy multiple-precision divisors and word-RAM constants
- Multiprecision integer division examples using arbitrary radix
- A Parallel Algorithm for Multiple-Precision Division by a Single-Precision Integer
- scientific article; zbMATH DE number 3978281 (Why is no real title available?)
- scientific article; zbMATH DE number 4009638 (Why is no real title available?)
- scientific article; zbMATH DE number 40800 (Why is no real title available?)
- Choices of operand truncation in the SRT division algorithm
- Mesh algorithms for multiplication and division
- A multiple-precision division algorithm
- SRT Division Algorithms as Dynamical Systems
- “Logical” arithmetic on computers with two's complement binary arithmetic
- Deterministic Division Algorithm in a Negative Base
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740119)