剩余数系统{2n+1, 2n+1+1, 2n}符号检测设计与优化

提出一个新的针对剩余数模集合{2n+1,2n+1+1,2n},快速的符号检测算法。该符号检测系统仅由3个单元组成,一个n位宽度的仅为保留加法器单元,一个n位比较器单元和一个n位前缀加法器单元,其中进位保留加法器和比较器单元是并行的。实验结果表明,相比于其他剩余数符号检测系统,平均速度提高了约36%,面积相对保留约63%。

Design and Optimization of Sign Detection in Residue Number System {2n+1, 2n+1+1, 2n}

In this paper, we propose a fast algorithm for sign-extraction of a number given in the Residue Number System{2n+1, 2n+1+1, 2n}. The algorithm can be implemented using three units, one n-bit wide carry save adder, one n-bit wide comparator, and one prefix adder unit, two of which can be done in parallel. The experimental results indicate that the proposed circuit offers 63%, and 36% savings on average in terms of area, and delay, respectively, better than the unit based on previous sign detection algorithm.