Abstract
This paper discusses the use of signed-digit representations in the implementation of fast and efficient residue-arithmetic units. Improvements to existing signed-digit modulo adders and multipliers are suggested and new converters for the residue signed-digit number system are described for the moduli {2n-1,2n,2n+1}. By extending an existing efficient signed-digit adder design to handle modulo operations, we are able to implement high performance modulo addition. The hardware complexity of signed-digit modulo multipliers is reduced by using a more efficient algorithm for calculating partial products. Finally, the novel converters presented makes it possible to integrate this residue signed-digit number system with conventional binary circuits.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Wei, S., Shimizu, K.: Fast residue arithmetic multipliers based on signed digit number system. In: IEEE 8th Conf. Electronics, Circuits and Systems, vol. 1, pp. 263–266 (2001)
Wei, S., Shimizu, K.: A novel residue arithmetic hardware algorithm using a signed-digit number representation. IEICE Trans. inf. & syst. E83-D(12), 2056–2064 (2000)
Koren, I.: Computer Arithmetic Algorithms, 2nd edn. A K Peters Ltd., Natick (2002) ISBN: 1-56881-160-8
Takagi, N.: High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree. IEEE Transactions on Computers c-34(9), 789–796 (1985)
Kuninobu, S., Nishiyama, T., Edamatu, H., Taniguchi, T., Takagi, N.: Design Of High Speed MOS Multiplier And Divider Using Redundant Binary Representation. In: IEEE Proc. 8th Symp. Computer Arithmetic, pp. 80–86 (1987)
Vandemeulebroecke, A., Vanzieleghem, E., Denayer, T., Jespers, P.G.A.: A New Carry-Free Division Algorithm and its Application to a Singler-Chip 1024-b RSA Processor. IEEE Journal of solid-state circuits 25(3), 748–756 (1990)
Vinnakota, B., Bapeswara Rao, V.V.: Fast Conversion Techniques for Binary-Residue Number systems. IEEE Trans. Circuits and Systems 41(12) (December 1994)
Wang, Y.: Residue-to-binary converters based on new chinese remainder theorems. IEEE Trans. Circuits Syst. II, 197–206 (March 2000)
Lindström, A., Nordseth, M.: VHDL Library of Nonstandard Arithmetic Units [Online] (2003, Mars), Available: http://www.ce.chalmers.se/arithdb/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lindström, A., Nordseth, M., Bengtsson, L., Omondi, A. (2003). Arithmetic Circuits Combining Residue and Signed-Digit Representations. In: Omondi, A., Sedukhin, S. (eds) Advances in Computer Systems Architecture. ACSAC 2003. Lecture Notes in Computer Science, vol 2823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39864-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-39864-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20122-9
Online ISBN: 978-3-540-39864-6
eBook Packages: Springer Book Archive