Implementation of a Fast Sign Detection Algoritm for the RNS Moduli Set {2N+1 -1, 2N -1, 2N }, N = 16, 64
Main Article Content
Abstract
In this dissertation a fast sign detection algorithm for the residue number system (RNS) moduli set {2N+1 -1, 2N -1 , 2N }, N =16,64 is illustrated. This algorithm allows parallel implementation and completes the implementation with simply modulo 2n additions. This unit can be implemented using one carry save adder, one comparator, one carry generation unit and post processing unit. The results of this algorithm confirm that the area and delay are reduced compared to mixed radix conversion and Chinese reminder theroms. This algorithm is implemented using verilog language tool in Xilinx 13.2 version.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
IJCERT Policy:
The published work presented in this paper is licensed under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. This means that the content of this paper can be shared, copied, and redistributed in any medium or format, as long as the original author is properly attributed. Additionally, any derivative works based on this paper must also be licensed under the same terms. This licensing agreement allows for broad dissemination and use of the work while maintaining the author's rights and recognition.
By submitting this paper to IJCERT, the author(s) agree to these licensing terms and confirm that the work is original and does not infringe on any third-party copyright or intellectual property rights.
References
N. Szabo, “Sign detection in nonredundant residue systems,” IRE Trans. Electron. Comput., vol. EC-11, no. 4,pp. 494-500, Aug. 1962.
Z, UIman, “Sign detection and implicit-explicit conversion of numbers in residue arithmetic,” IEEE Trans. Comput., vol. 32, no. 6, pp.590-594, Jun. 1983.
T. V. Vu, Efficient implementations of the Chinese remainder thermo for sign detection and residue decoding,” IEEE Trans. Comput., vol. 34, no. 7, pp. 646- 651, Jul. 1985.
E.AI-Radadi and P.Siy, “RNS sign detector based on Chinese remainder theorem II (CRT II).” Comput., Math. Appl., vol. 46, nos. 10-11, pp. 1559-1570, 2003.
M. Akkal and P. siy, “Optimum RNS sign detection algorithm using MRC-II with special moduli set,” J. Syst. Arch., vol. 54, no. 10, pp. 911-918, Oct. 2008.
T. Tomczak, “Fast sign detection for RNS,2n1,2n,2n+1},” IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 55, no. 6, pp. 1502-1511, Jul. 2008.
P. Mohan, “RNS-to-binary converter for a new three-moduli set {2n+1-1, 2n, 2n-1},” IEEE Trans. Cir- cuits Syst. II, Exp. Briefs, vol. 54, no. 9, pp. 775-779, Sep. 2007.
S. Bi and W. Gross, “The mixed-radix Chinese remainder theorem and its applications to residue comparison,” IEEE Trans. Comput. Vol. 57, no. 12, pp. 1624- 1632, Dec. 2008.
S. Piestrak, “Design of residue generators and multioperand modular adders using carry-save adders,” IEEE Trans. Comput., vol. 43, no. 1, pp. 68-77, Jan. 1994.
R. Zimmerman, “Efficient VLSI implementation of modulo (2n ± 1) addition and multiplication,” in Proc. 14th IEEE Symp. Comput. Arithmetic, 1999, pp. 158- 167.
K. Furuya, “Design methodologies of comparators based on parallel hardware algorithms,” in Proc. 10th ISCIT, Oct. 2010, pp. 591-596.