Integer Division in Residue Number Systems

  title={Integer Division in Residue Number Systems},
  author={Markus A. Hitz and Erich L. Kaltofen},
  journal={IEEE Trans. Computers},
This contribution to the ongoing discussion of division algorithm for residue number systems (RNS) is based on Newton iteration for computing the reciprocal. An extended RNS with twice the number of moduli provides the range required for multiplication and scaling. Separation of the algorithm description from its RNS implementation achieves a high level of modularity, and makes the complexity analysis more transparent. The number of iterations needed is logarithmic in the size of the quotient… 

Figures from this paper

A New Euclidean Division Algorithm for Residue Number Systems
This work proposes a new algorithm and architecture for performing divisions in residue number systems (RNS) with the use of a high-radix division method and a floating-point arithmetic that should run in parallel with the modular arithmetic.
A division algorithm for residue numbers
A low power algorithm for division in residue number system (RNS)
  • A. Hussein, M. Hasan, M. Elmasry
  • Computer Science, Mathematics
    Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)
  • 1998
A new algorithm for computing division in residue number system (RNS) is presented that imposes no restrictions on the dividend and the divisor, and requires no initial quotient estimation.
Improved Modular Division Implementation with the Akushsky Core Function
This paper optimize the division operation in RNS using the Akushsky core function without critical cores and shows that the proposed method reduces the size of the operands by half and does not require additional restrictions on the divisor as in the division algorithm in R NS based on the approximate method.
Non-iterative RNS Division Algorithm
A non-iterative algorithm for division in RNS system is presented in which all numbers as denominator are accepted and shows more than 2 times increase in speed and efficiency during divide operation.
A Division Algorithm in a Redundant Residue Number System Using Fractions
A new modular division algorithm based on the Chinese remainder theorem (CRT) with fractional numbers, which allows using only one shift operation by one digit and subtraction in each iteration of the RNS division, is proposed.
An Efficient Parallel Reverse Conversion of Residue Code to Mixed-Radix Representation Based on the Chinese Remainder Theorem
This paper presents a novel approach to the parallel reverse conversion from the residue code into a weighted number representation in the Mixed-Radix System (MRS) and estimates the computational complexity as Ok2/2, where k equals the number of used moduli.
Using Floating-Point Intervals for Non-Modular Computations in Residue Number System
This work proposes to compute the interval evaluation of the fractional representation of an RNS number in floating-point arithmetic of limited precision and proposes new algorithms for magnitude comparison and general division in RNS and implements them for GPUs using the CUDA platform.
A parity checker for a large residue numbers based on Montgomery reduction method
A fast parity checker with minimal hardware processed in three clock cycles for 32-bit RNS modulus set is presented, implemented by using multipliers and the carry-save adder array.


New approach to integer division in residue number systems
  • D. Gamberger
  • Mathematics
    [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic
  • 1991
A novel division algorithm that is especially appropriate for residue number systems (RNSs) is presented. It makes use of the fact that the multiplicative inverse element of a divisor which is
A Novel Division Algorithm for the Residue Number System
A novel general algorithm for signed number division in the residue number system (RNS) is presented that is simple, efficient, and practical for implementation on a real RNS divider.
A new residue number system division algorithm
A Fully Parallel Mixed-Radix Conversion Algorithm for Residue Number Applications
  • C. Huang
  • Computer Science
    IEEE Transactions on Computers
  • 1983
A new, fully parallel mixed-radix conversion (MRC) algorithm which utilizes the maximum parallelism that exists in the residues (RNS) to mixed-radix (MR) digits conversion to achieve high throughput
A high speed division method in residue arithmetic
A new method is proposed for choosing an approximate divisor, approximate dividends and the partial quotients and it is proposed that this method yields correct quotients faster than the existing methods and is general in its application.
Fast Parallel Arithmetic via Modular Representation
An almost uniform $NC^1 $ circuit family for integer division is presented, based on modular representation for integers below $2^n $, which leads to a uniform circuit of O(n^2 ) size for comparison of integers in modular representation.
Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
This chapter discusses sorting on a Linear Array with a Systolic and Semisystolic Model of Computation, which automates the very labor-intensive and therefore time-heavy and expensive process of manually sorting arrays.
The Design and Analysis of Computer Algorithms
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
The Design and Analysis of Computer Algorithms; Addison and Wesley
  • 1974
Jen-Shiun, \A novel division al- gorithm for the residue number system,
  • IEEE Trans. Comput.,
  • 1992