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

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

著者

• Luo Fei

  School Of Automation Science And Engineering South China University Of Technology

• Yao Ruohe

  School Of Electronic And Information Engineering South China University Of Technology

• LUO Fei

  School of Automation Science and Engineering, South China University of Technology

• XU Minghe

  School of Electronic and Information Engineering, South China University of Technology

関連論文

• Low-Voltage Class-AB CMOS Output Stage with Tunable Quiescent Current
• Low-Complexity Sign Detection Algorithm for RNS {2n-1, 2n, 2n+1}
• Soft-Start Circuit Based on Switched-Capacitor for DC-DC Switching Regulator

スポンサーリンク