The search functionality is under construction.
The search functionality is under construction.

Low-Complexity Sign Detection Algorithm for RNS {2n-1, 2n, 2n+1}

Minghe XU, Ruohe YAO, Fei LUO

  • Full Text Views

    0

  • Cite this

Summary :

Based on a reverse converter algorithm derived from the New Chinese Remainder Theorem I, an algorithm for sign detection of RNS {2n-1, 2n, 2n+1} is presented in this paper. The hardware of proposed algorithm can be implemented using two n-bit additions and one (n+1)-bit comparator. Comparing with the previous paper, the proposed algorithm has reduced the number of additions used in the circuit. The experimental results show that the proposed circuit achieves 17.3% savings in area for small moduli and 10.5% savings in area for large moduli on an average, with almost the same speed. The power dissipations obtain 12.6% savings in average.

Publication
IEICE TRANSACTIONS on Electronics Vol.E95-C No.9 pp.1552-1556
Publication Date
2012/09/01
Publicized
Online ISSN
1745-1353
DOI
10.1587/transele.E95.C.1552
Type of Manuscript
BRIEF PAPER
Category
Electronic Circuits

Authors

Keyword