Fast Converter for 3 Moduli RNS Using New Property of CRT
IEEE Transactions on Computers
High-Speed and Reduced-Area Modular Adder Structures for RNS
IEEE Transactions on Computers
A New Technique for Fast Number Comparison in the Residue Number System
IEEE Transactions on Computers
Scaled and Unscaled Residue Number System to Binary Conversion Techniques using the Core Function
ARITH '97 Proceedings of the 13th Symposium on Computer Arithmetic (ARITH '97)
The application of core functions to residue number systems
IEEE Transactions on Signal Processing
| Hi-index | 0.09 |
This work is based upon the core function of a RNS (residue number system) number. In determination of the core of a RNS number, an ambiguity problem arises. In this study, we have proposed a new technique named SAS (scaled and shift) to eliminate the ambiguity problem existing in Akushkii's [1] core function. The gain is to compute the core value straightforward without utilizing any other subsystem to detect and remove the ambiguity. Also a new algorithm named WSA (weight selection algorithm) is introduced that gives us the optimum weight set for SAS technique. The optimum weights achieved from WSA provide us with the least complex (smallest possible) weights with the least nonlinearity of the core function.