Tudor Jebelean
- 1.BUCHBERGER, B., COI.LINS, G. E., ENCARNACION, M. J., HONG, H., JOHNSON, J. R., KRANDICK, W., LOOS, R., MANDACHE, A. l~., NEUBACHER, A., AND VIELHABER, H. SACLIB 1.1 User's Guide. Tech. Rep. 93-19, RISC--Linz, 1993.Google Scholar
- 2.JEBELEAN, T. A generalization of the binary GCD algorithm. In ISSAC'93: International Symposium on Symbolic and Algebraic Computation (Kiev, Ukraine, July 1993), M. Bronstein, Ed., ACM Press, pp. 111-116. Google ScholarDigital Library
- 3.JEBELEAN, T. An algorithm for exact division. Journal of Symbolic Computation 15, 2 (February 1993), 169- 180. Google ScholarDigital Library
- 4.KARATSUBA, i., AND OFMAN, Y. Multiplication of multidigit numbers on automata. Soy. Phys. Dokl. 7 (1962), 595-596.Google Scholar
- 5.KNUTH, D. E. The art of computer programming, 2 ed., vol. 2. Addison-Wesley, 1981. Google ScholarDigital Library
- 6.KRANDICK, W., AND JEBELEAN, T. Bidirectional exact integer division. Journal of Symbolic Computation 21 (1996), 441-455. Google ScholarDigital Library
- 7.KRANDICK, W., AND JOUNSON, J. R. Efficient multiprecision floating point multiplication with exact rounding. Tech. Rep. 93-76, RISC-Linz, RISC-Linz, Johannes Kepler University, A-4040 Linz, Austria, 1993. presented at the Rhine Workshop on Computer Algebra, Karlsruhe, Germany, 1994.Google Scholar
- 8.KRAND~CK, W., AND JOHNSON, J. R. Efficient multiprecision floating point multiplication with optima{ directional rounding. In Proceedings of the 11th IEEE Symposium on Computer Arithmetic (P.O.Box 3041, Los Alamitos, CA 90720-126, Phone: 714 821-838, 1993), E. Swartzlander, .}r., M. J. Irwin, and G. Jullien, Eds., IEEE, IEEE Computer Society Press, pp. 228-233.Google Scholar
- 9.WEBER, K, The accelerated integer GCD algorithm. ACM Trans. on Math. Software 21, 1 (March 1995), 111- 122. Google ScholarDigital Library
Index Terms
- Practical integer division with Karatsuba complexity
Recommendations
Prescaled Integer Division
ARITH '03: Proceedings of the 16th IEEE Symposium on Computer Arithmetic (ARITH-16'03)We describe a high radix integer division algorithm where the divisor is prescaled and the quotient is postscaled without modifying the dividend to obtain an identity N = Q* D + R* with the quotient Q* differing from the desired integer quotient Q only ...
Integer Division in Linear Time with Bounded Fan-In
A binary algorithm for division of an (M + N)-bit integer by an N-bit integer is presented. The algorithm produces the (M + 1)-bit quotient and the N-bit remainder in time O(M + N). Two hardware implementations, one using combinational logic in cellular ...
Division Unit for Binary Integer Decimals
ASAP '09: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and ProcessorsIn this work, we present a radix-10 division unit that is based on the digit-recurrence algorithm and implements binary encodings (Binary Integer Decimal or BID) for significands. Recent decimal division designs are all based on the Binary Coded Decimal ...
Comments