A general division algorithm for residue number systems
- 9 December 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A general algorithm for signed number division in residue number systems (RNSs) is presented. A parity checking technique is used to accomplish the sign and overflow detection in this algorithm. Compared with conventional methods of sign and overflow detection, the parity checking method is more efficient and practical. Sign magnitude arithmetic division is implemented using binary search. There is no restriction on the dividend and the divisor (except zero divisor), and no quotient estimation is necessary before the division is started. In hardware implementations, the storage of one table is required for parity checking, and all the other arithmetic operations are completed by calculations. Only simple operations are needed to accomplish this RNS division.<>Keywords
This publication has 7 references indexed in Scilit:
- A new residue number system division algorithmComputers & Mathematics with Applications, 1990
- An implementation of the LMS algorithm in the residue number systemIEEE Transactions on Circuits and Systems, 1984
- Division and sign detection algorithms for residue number systemsComputers & Mathematics with Applications, 1984
- A VLSI Residue Arithmetic MultiplierIEEE Transactions on Computers, 1982
- The use of residue number systems in the design of finite impulse response digital filtersIEEE Transactions on Circuits and Systems, 1977
- General Division in the Symmetric Residue Number SystemIEEE Transactions on Computers, 1973
- Division and Overflow Detection in Residue Number SystemsIEEE Transactions on Electronic Computers, 1962