"A novel implementation method for addition and subtraction in residue number systems"
This paper describes a novel implementation scheme for the operations of addition and subtraction in the residue number systems. The method is based on the property that the set of residues modulo m form a finite group under addition (mod m). Therefore, any row in the modulo m addition table is simp...
Saved in:
Published in | 1972 IEEE 2nd Symposium on Computer Arithmetic (ARITH) pp. 1 - 15 |
---|---|
Main Author | |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.05.1972
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper describes a novel implementation scheme for the operations of addition and subtraction in the residue number systems. The method is based on the property that the set of residues modulo m form a finite group under addition (mod m). Therefore, any row in the modulo m addition table is simply a permutation of the elements of any other row. The effect of this on the implementation scheme is as follows: The set of residues modulo m (o to m−1) are held in a register. For operands X and Y, X is used to permute the contents of the register and Y is used to select the appropriate part of the register to be gated into the sum register. |
---|---|
DOI: | 10.1109/ARITH.1972.6153891 |