Abstract :
In this paper, we propose a fast algorithm for sign-extraction of a number given in the Residue Number System (2n-1,2n,2n+1) . The algorithm can be implemented using three n-bit wide additions, two of which can be done in parallel. It can be used in a wide variety of problems, i.e., in algorithms for dividing numbers in the RNS, or in evaluating the sign of determinant in computational geometry, etc.
Keywords :
adders; computational geometry; determinants; residue number systems; computational geometry; determinant; fast algorithm; fast sign detection; n-bit wide additions; residue number system; sign-extraction; Computer architecture; VLSI; computer architecture; digital arithmetic; digital circuits; residue number system (RNS); sign detection;