A general division algorithm for residue number systems Conference Paper

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.

name of conference

• [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic

authors

• Lu, Mi

published proceedings

• Proceedings - Symposium on Computer Arithmetic
• [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic

author list (cited authors)

• Chiang, J., & Lu, M.

citation count

• 7

complete list of authors

• Chiang, J-S||Lu, M

publication date

• January 1991

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

Digital Object Identifier (DOI)

• 10.1109/arith.1991.145537

International Standard Book Number (ISBN) 10

• 0818691514

start page

• 76

end page

• 83

URL

• http://dx.doi.org/10.1109/arith.1991.145537