Abstract
This paper presents a new fast RNS converter for the 3 moduli set of the form {2 n - 1,2 n, 2 n + 1}. A new property of the CRT is also presented and this property is used to develop a fast converter for this 3 moduli set. The resulting implementation is based on carry-save adders and one carry-propagate adder stage, without the need for any look-up tables. The new design is faster and smaller than existing designs.
Original language | English |
---|---|
Pages (from-to) | 852-860 |
Number of pages | 9 |
Journal | IEEE Transactions on Computers |
Volume | 48 |
Issue number | 8 |
DOIs | |
Publication status | Published - Aug 1999 |
Keywords
- Chinese remainder theorem (CRT)
- Residue number system (RNS) converter