DocumentCode :
1059642
Title :
Fast Sign Detection for RNS (2^{n}-1,2^{n},2^{n}+1)
Author :
Tomczak, Tadeusz
Author_Institution :
Inst. of Comput., Wroclaw Univ. of Technol., Warsaw
Volume :
55
Issue :
6
fYear :
2008
fDate :
7/1/2008 12:00:00 AM
Firstpage :
1502
Lastpage :
1511
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;
fLanguage :
English
Journal_Title :
Circuits and Systems I: Regular Papers, IEEE Transactions on
Publisher :
ieee
ISSN :
1549-8328
Type :
jour
DOI :
10.1109/TCSI.2008.917994
Filename :
4446770
Link To Document :
بازگشت