Journal
COMPUTERS & MATHEMATICS WITH APPLICATIONS
Volume 50, Issue 3-4, Pages 459-470Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.camwa.2005.03.008
Keywords
residue number system; core function; chinese remainder theorem; algorithm; moduli set; modulus
Categories
Ask authors/readers for more resources
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. (c) 2005 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available