A consideration of a practical implementation for a new convergence division
From MaRDI portal
Publication:1055188
DOI10.1016/0020-0190(83)90113-8zbMath0521.68030OpenAlexW2023905999MaRDI QIDQ1055188
Publication date: 1983
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(83)90113-8
iterative processdivision algorithmconvergence divisionmanageable table sizereduction of bit length of multipliersubdivision tablesuccessive multiplication
Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Algorithms in computer science (68W99) Acceleration of convergence in numerical analysis (65B99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Speeding up an overrelaxation method of division in Radix-2 n machine
- An overrelaxation for a numerical inverse of a constant
- Combinational Circuit Synthesis with Time and Component Bounds
- On-Line Algorithms for Division and Multiplication
- The IBM System/360 Model 91: Floating-Point Execution Unit
- A Note on the Basic Block Diagrams of Finite Automata from the Engineering Point of View
- Automatic Computation of Exponentials, Logarithms, Ratios and Square Roots
- Majority Gate Networks
This page was built for publication: A consideration of a practical implementation for a new convergence division