Abstract
Stored Unibit Transfer (SUT) has recently been considered as a redundant high-radix encoding for the channels of a Residue Number System (RNS) that can improve the efficiency of conventional redundant RNS. In this work we propose modulo 2n ± 1 forward and reverse converters for the SUT-RNS encoding. The proposed converters are based on parallel-prefix binary or modulo adders and are therefore highly efficient.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ananda Mohan PV (2002) Residue number systems: algorithms and architectures. Kluwer, Netherlands
Omondi A, Premkumar B (2007) Residue number systems: theory and implementation. Imperial College Press, London
Chaves R, Sousa L (2003) RDSP: a RISC DSP based on residue number system. In: Proceedings of 6th Euromicro symposium on digital system design, pp 128–135. doi:10.1109/dsd.2003.1231911
Fernandez PG, Lloris A (2003) RNS-based implementation of 8x8 point 2D-DCT over field-programmable devices. Electron Lett 39:21–23. doi:10.1049/el:20030084
Liu Y, Lai E (2004) Moduli set selection and cost estimation for RNS-based FIR filter and filter bank design. Des Autom Embed Syst 9:123–139. doi:10.1007/s10617-005-1186-4
Cardarilli G, Nannarelli A, Re M (2007) Residue number system for low-power DSP applications. In: Proceedings of asilomar conference on signals, systems and computers, pp 1412–1416. doi:10.1109/acssc.2007.4487461
Bajard JC, Imbert L (2004) A full RNS implementation of RSA. IEEE Trans Comput 53:769–774. doi:10.1109/tc.2004.2
Meyer-Baese U, Garcia A, Taylor F (2001) Implementation of a communications channelizer using FPGAs and RNS arithmetic. J VLSI Signal Process 28:115–128. doi:10.1023/a:1008167323437
Madhukumar AS, Chin F (2004) Enhanced architecture for residue number system-based CDMA for high-rate data transmission. IEEE Trans Wireless Commun 3:1363–1368. doi:10.1109/twc.2004.833509
Avizienis A (1961) Signed-digit representation for fast parallel arithmetic. IRE Trans Electron Comput EC-10:389–400. doi:10.1109/tec.1961.5219227
Jaberipur G, Parhami B, Ghodsi M (2005) Weighted two-valued digit-set encodings: unifying efficient hardware representation schemes for redundant number systems. IEEE Trans Circuits Syst I 52:1348–1357. doi:10.1109/tcsi2005.851679
Jaberipur G, Parhami B (2007) Stored-transfer representations with weighted digit-set encodings for ultrahigh-speed arithmetic. IET Circuits Devices Syst 1:102–110. doi:10.1049/iet-cds:20050228
Jaberipur G, Parhami B (2009) Unified approach to the design of modulo-(2n ± 1) adders based on signed-LSB representation of residues. In: Proceedings of IEEE international symposium on computer arithmetic, pp 57–64. doi:10.1109/arith.2009.14
Lindstrom A, Nordseth M, Bengtsson L, Omondi A (2003) Arithmetic circuits combining residue and signed-digit representations. In: Proceedings of 8th Asia-Pacific computer systems architecture conference, pp 246–257. doi:10.1007/978-3-540-39864-6_20
Wei S (2008) A new residue adder with redundant binary number representation. In: Proceedings of 6th international IEEE north-east workshop on circuits and systems, pp 157–160. doi:10.1109/newcas.2008.4606345
Persson A, Bengtsson L (2009) Forward and reverse converters and moduli set selection in signed-digit residue number systems. J Signal Process Syst 56:1–15. doi:10.1007/s11265-008-0249-8
Timarchi S, Navi K (2007) Efficient class of redundant residue number system. In: Proceedings of IEEE international symposium on intelligent signal processing, pp 475–780. doi:10.1109/wisp.2007.4447506
Timarchi S, Navi K (2009) Arithmetic circuits of redundant SUT-RNS. IEEE Trans Instrum Meas 58:2959–2968. doi:10.1109/tim.2009.2016793
Kogge PM, Stone HS (1973) A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Trans Comput 22:786–792. doi:10.1109/tc.1973.5009159
Vergos HT, Bakalis D, Efstathiou C (2010) Fast modulo 2n + 1 multi-operand adders and residue generators. Integr VLSI J 43:42–48. doi:10.1016/j.vlsi.2009.04.002
Tyagi A (1993) A reduced-area scheme for carry-select adders. IEEE Trans Comput 42:1163–1170. doi:10.1109/12.257703
Kalampoukas L, Nikolos D, Efstathiou C, Vergos HT, Kalamatianos J (2000) High-speed parallel prefix modulo 2n–1 adders. IEEE Trans Comput 49:673–680. doi:10.1109/12.863036
Vergos HT, Efstathiou C, Nikolos D (2002) Diminished-one modulo 2n + 1 adder design. IEEE Trans Comput 51:1389–1399. doi:10.1109/tc.2002.1146705
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media B.V.
About this paper
Cite this paper
Vassalos, E., Bakalis, D., Vergos, H.T. (2011). SUT-RNS Forward and Reverse Converters. In: Voros, N., Mukherjee, A., Sklavos, N., Masselos, K., Huebner, M. (eds) VLSI 2010 Annual Symposium. Lecture Notes in Electrical Engineering, vol 105. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-1488-5_14
Download citation
DOI: https://doi.org/10.1007/978-94-007-1488-5_14
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-1487-8
Online ISBN: 978-94-007-1488-5
eBook Packages: EngineeringEngineering (R0)