Title of article
Core function of an RNS number with no ambiguity
Author/Authors
M. Abtahi، نويسنده , , P. Siy، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2005
Pages
12
From page
459
To page
470
Abstract
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.
Keywords
Residue number system , Core function , Chinese remainder theorem , Moduli set , Modulus , Algorithm
Journal title
Computers and Mathematics with Applications
Serial Year
2005
Journal title
Computers and Mathematics with Applications
Record number
920312
Link To Document