Abstract
High efficient implementation of scaling in residue number system (RNS) is one of the critical issues for the applications of RNS in digital signal processing (DSP) systems. In this paper, an efficient scaling algorithm for signed integers in RNS is proposed firstly through introducing a correction constant in negative integers scaling procedure. Based on the proposed scaling algorithm, an efficient RNS 2n scaling implementation method is presented, in which Chinese remainder theorem (CRT) and a redundant modulus are used to perform the base extension to obtain the least significant n bits of RNS integers. With the redundant modulus, the RNS sign detection can be achieved by the parity detection. And then, an approach to update the residue digit of the redundant channel is also proposed. Meanwhile, this paper provides a method of computing the correction constant of the redundant channel in negative integers scaling. The analysis results indicate that the complexity of the proposed scaling algorithm grows linearly with the word-length of the RNS dynamic range without using Look-up Table (LUT). Furthermore, the proposed algorithm is employed for a specific moduli set 2n scaling. The synthesis results show that the critical path of the proposed algorithm is shortened by 12%, the area and power consumption performance is improved by about 35%, compared to the existing cascading 2n scaling method for very large scale integration (VLSI) implementation under the same restriction. Besides, the VLSI layout indicates that the parallel structure is simpler.
Similar content being viewed by others
References
William J. Dally S L. VLSI architecture: past, present, and future. In: Proceedings of the 20th Anniversary Conference on Advanced Research in VLSI, Atlanta, GA, USA, 1999. 232–241
Ananth G, George K, Vipin K, et al. Introduction to Parallel Computing. 2nd ed. Addison Wesley, 2003
Liu Y, Lai E M K. Design and implementation of an RNS-based 2-D DWT processor. IEEE Trans Consum Electron, 2004, 50: 376–385
Lindahl A, Bengtsson L. A low-power FIR filter using combined residue and radix-2 signed-digit representation. In: Proceedings of the 2005 8th Euromicro Conference on Digital System Design (DSD’05), Porto Portugal, 2005. 42–47
Ma S, Hu J H, Zhang L, et al. An efficient RNS parity checker for moduli set {2n−1, 2n+1, 22n+1} and its applications. Sci China Ser F-Inf Sci, 2008, 51: 1563–1571
Jullien G A. Residue number scaling and other operations using ROM arrays. IEEE Trans Comput, 1978, c-27: 325–336
Shenoy M A P, Kumaresan R. A fast and accurate RNS scaling technique for high speed signal processing. IEEE Trans Acoust Speech Signal Process, 1989, 37: 929–937
Ulman Z, Czyzak M, Zurada J. Effective RNS scaling algorithm with the Chinese remainder theorem decomposition. In: IEEE Pacific Rim Conf Commun Comput Signal Proce, Victoria, Canada, 1993, 2: 528–531
Garcia A, Lloris A. A look-up scheme for scaling in the RNS. IEEE Trans Comput, 1999, 48: 748–751
Cardarilli G C, Del Re A, Nannarelli A. Programmable power-of-two RNS scaler and its application to a QRNS polyphase filter. IEEE Int Sympos Circ Syst, 2005, 2: 1102–1105
Barsi F, Pinotti M C. Fast base extension and precise scaling in RNS for look-up table implementations. IEEE Trans Signal Process, 1995, 43: 2427–2430
Garcia A, Lloris A. RNS scaling based on pipelined multipliers for prime moduli. In: IEEE Workshop on Signal Processing Systems (SIPS 98), Piscataway, New Jersey, USA, 1998. 459–468
Soudris D, Dasygenis M, Mitroglou K, et al. A full adder based methodology for scaling operation in residue number system. In: 9th International Conference on Electronics, Circuits and Systems, Dubrovnik, Croatia, 2002, 3: 891–894
Burgess N. Scaling an RNS number using the core function. In: Proceedings of 16th IEEE Symposium on Computer Arithmetic, Santiago de Compostela, Spain, 2003. 262–269
Meyer B U, Stouraitis T. New power-of-2 RNS scaling scheme for cell-based IC design. IEEE Trans VLSI Syst, 2003, 11: 280–283
Burgess N. Scaled and unscaled residue number system to binary conversion techniques using the core function. In: Proceedings of 13th IEEE Symposium on Computer Arithmetic, Asilomar, California, USA, 1997. 250–257
Meehan S J, O’Neil S D, Vaccaro J J. An universal input and output RNS converter. IEEE Trans Circ Syst, 1990, 37: 799–803
Manochehri K, Pourmozafari S, Sadeghian B. Efficient methods in converting to modulo 2n + 1 and 2n − 1. In: Proceedings of the Third International Conference on Information Technology: New Generations (ITNG’06), Las Vegas, Nevada, USA, 2006. 178–185
Mohan P V A, Premkunmar A B. RNS-to-binary converters for two four-moduli sets {2n − 1; 2n; 2n +1; 2n+1 − 1} and {2n − 1; 2n; 2n +1; 2n+1 − 1}. IEEE Trans Circ Syst, 2007, 54: 1245–1254
Shenoy M A P, Kumaresan R. Fast base extension using a redundant modulus in RNS. IEEE Trans Comput, 1989, 38: 292–297
Lu M, Chiang J S. A novel division algorithm for the residue number system. IEEE Trans Comput, 1992, 41: 1026–1032
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ma, S., Hu, J., Ye, Y. et al. A 2n scaling scheme for signed RNS integers and its VLSI implementation. Sci. China Ser. F-Inf. Sci. 53, 203–212 (2010). https://doi.org/10.1007/s11432-010-0015-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-010-0015-y