Call For Paper Volume:4 Issue:8 Aug'2017 |

RNS Moduli Set {2^(n+1)-1,2^(n)-1,2^n} Implementation Based on Fast Sign Detection Algorithm

Publication Date : 25/10/2015



Author(s) :

Prabu Venkateswaran S , Divyarajalakshmi M.


Volume/Issue :
Volume 2
,
Issue 10
(10 - 2015)



Abstract :

An efficient fast sign detection algorithm for the residue number system moduli set {2n+1-1, 2n-1, 2n} is presented. Initially the restricted moduli set including modulo 2n in the RNS are presented. The proposed algorithm which allows parallel implementation and include modulo 2n additions. Based on existing sign detection algorithm, an efficient sign detection algorithm for the moduli set {2n+1-1, 2n-1, 2n} is proposed. The sign detection unit can be implemented using a carry save adder, a comparator, carry generation unit with a post processing unit.


No. of Downloads :

5


Indexing

Web Design MymensinghPremium WordPress ThemesWeb Development

RNS Moduli Set {2^(n+1)-1,2^(n)-1,2^n} Implementation Based on Fast Sign Detection Algorithm

October 25, 2015