New algorithm for signed integer comparison in four-moduli superset {2n, 2n −1, 2n +1, 2n+1−1}
暂无分享,去创建一个
[1] Chip-Hong Chang,et al. Efficient reverse converters for four-moduli sets { 2n−1, 2n, 2n+1, 2n+1−1} and {2n−1, 2n, 2n+1, 2n−1−1} , 2005 .
[2] Richard I. Tanaka,et al. Residue arithmetic and its applications to computer technology , 1967 .
[3] Xiaoyu Song,et al. A new algorithm for RNS magnitude comparison based on New Chinese Remainder Theorem II , 1999, Proceedings Ninth Great Lakes Symposium on VLSI.
[4] Chip-Hong Chang,et al. Efficient VLSI Implementation of $2^{{n}}$ Scaling of Signed Integer in RNS ${\{2^{n}-1, 2^{n},2^{n}+1\}}$ , 2013, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.
[5] B. Cao,et al. Efficient reverse converters for four-moduli sets {2^n-1, 2^n, 2^n+1, 2^n^+^1-1} and {2^n-1, 2^n, 2^n+1, 2^n^-^1-1} , 2005 .
[6] Shun-Wen Cheng. A high-speed magnitude comparator with small transistor count , 2003, 10th IEEE International Conference on Electronics, Circuits and Systems, 2003. ICECS 2003. Proceedings of the 2003.
[7] Warren J. Gross,et al. The Mixed-Radix Chinese Remainder Theorem and Its Applications to Residue Comparison , 2008, IEEE Transactions on Computers.
[8] Leonel Sousa,et al. Efficient Method for Magnitude Comparison in RNS Based on Two Pairs of Conjugate Moduli , 2007, 18th IEEE Symposium on Computer Arithmetic (ARITH '07).
[9] J R King,et al. Analysis of the residue class core function of Akushskii, Burcev, and Pak , 1986 .
[10] Mi Lu,et al. A Novel Division Algorithm for the Residue Number System , 1992, IEEE Trans. Computers.
[11] Sebastiano Impedovo,et al. A New Technique for Fast Number Comparison in the Residue Number System , 1993, IEEE Trans. Computers.