Call for Paper - Upcoming Issues

Multiplier Design Incorporating Logarithmic Number System for Residue Number System in Binary Logic

International Journal of VLSI & Signal Processing
© 2018 by SSRG - IJVSP Journal
Volume 5 Issue 3
Year of Publication : 2018
Authors : Shalini R.V and Dr.P.Sampath
10.14445/23942584/IJVSP-V5I3P102
pdf
How to Cite?

Shalini R.V and Dr.P.Sampath, "Multiplier Design Incorporating Logarithmic Number System for Residue Number System in Binary Logic," SSRG International Journal of VLSI & Signal Processing, vol. 5,  no. 3, pp. 11-22, 2018. Crossref, https://doi.org/10.14445/23942584/IJVSP-V5I3P102

Abstract:

Residue Number System (RNS) incorporates several significant features that are indispensible in Digital Signal Processing (DSP) applications. It includes higher operational speed, secured processing of data, carry free operations that reduces propagation of error among modules and so on. Multiplication process is the vital part of several DSP functions and hence design of such process using RNS system is gaining potential. For further improving the processing speed and security level of RNS, Multilevel-Residue Number System (MRNS) is introduced. This paper deals about the implementation of Logarithmic Number System (LNS) in RNS to propose the multiplication design based on Residue Logarithmic Number System (RLNS). Multilevel-Residue Number System (M-RNS) is incorporated in this research work introducing Multilevel-Residue Logarithmic Number System (M-RLNS) based multiplier design. Use of logarithmic numbers are restricted on accuracy constraints, hence improvement in accuracy is realized by employing error correction circuits. Area, Total Power Dissipation (TPD), delay and Power Delay Product (PDP) of the multiplication design proposed are tabulated for number of bits, N=8, 16 and 32 and the same is compared with the existing design.

Keywords:

 Residue Number System (RNS), Logarithmic Number System (LNS), Multilevel-Residue Number System (M-RNS), Multilevel-Residue Logarithmic Number System (M-RLNS), Error correction circuits.

References:

[1] Keivan Navi, Amir Sabbagh Molahosseini, and Mohammad Esmaeildoust, “How to Teach Residue Number System to Computer Scientists and Engineers”, IEEE Transaction on Education, vol. 54, pp. 156-163, November 2011. 
[2] W. K. Jenkins, and B. J. Leon, “The use of residue number systems in the design of finite impulse response digital filters”, IEEE Trans. Circuits Syst., vol. 24, pp. 191–201, April 1977. 
[3] R. Conway, and J. Nelson, “Improved RNS FIR filter architectures”, IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 51, pp. 26–28, January 2004. 
[4] J. Ramirez, U. Meyer-Base, and A. Garcia, “Efficient RNS-based design of programmable FIR filters targeting FPL technology”, J. Circuits,Syst. Comput., vol. 14, pp. 165–17, Februrary 2005. 
[5] K. C. Posch, and R. Posch, “Residue Number System: a key to parallelism in public key cryptography”, in Proc. of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992, p. 432. 
[6] D. M. Schinianakis , A. P. Kakarountas, and T. Stouraitis, “A novel approach to elliptic curve cryptography: an RNS architecture”, in Proc. of IEEE Mediterranean Electrotechnical Conference (MELECON), 2006, p. 1241. 
[7] Yinan Kong, and Yufeng Lai, “Low latency modular multiplication for public-key cryptosystems using a scalable array of parallel processing elements”, in Proc. of IEEE 56th International Midwest Symposium on Circuits and Systems (MWSCAS), 2013, p. 1039. 
[8] Wang Wei, M. N. S. Swamy, and M. O. Ahmad, “RNS application for digital image processing”, in Proc. 4th IEEE Int. Workshop System-on-Chip Real-Time, 2004, p. 77. 
[9] G. C. Cardarilli, A. Nannarelli, and M. Re, “Residue number system for low-power DSP applications”, in Proc. 41st IEEE Asilomar Conf. Signals, Syst., Comput., 2007, p. 1412. 
[10] A. Ammar, et al, “A secure image coding using residue number system”, in Proc. 18th Nat. Radio Sci. Conf. 2, 2001, p. 399. 
[11] V. Paliouras, and T. Stouraitis, “Low-power properties of the logarithmic number system”, in Proc. 17th IEEE Symposium on Computer Arithmetic, 2001, p. 229. [12] R. K. Agrawal, and H. M. Kittur, “ASIC based logarithmic multiplier using iterative pipelined architecture”, in Proc. IEEE conference on Information and Communication Technologies (ICT), 2013, p. 362. 
[13] D. M. Lewis, “114 MFLOPS Logarithmic Number System Arithmetic Unit for DSP Applications”, IEEE Journal of Solid-State Circuits, vol. 30, pp. 1547 – 1553, February 1995. 
[14] M. G. Arnold, “The residue logarithmic number system: theory and implementation”, in Proc 17th IEEE Symposium on Computer Arithmetic, 2005, p. 196. 
[15] B. Lee, and N. Burgess, “A Dual-Path Logarithmic Number System Addition/Subtraction Scheme for FPGA”, in Proc International Conference on Field Prog. Logic App., 2003, p. 808. 
[16] A. Mousavi, and D. K. Taleshmekaeil, “Pipelined Residue Logarithmic Number System for general modules set {2n-1, 2n, 2n+1}”, in Proc. 5th Internaional conference on Computer Sciences and Convergence Information Technology, 2010, p.700. 
[17] Davar Kheirandish Taleshmekaeil, and Alireza Mousavi, “Circuit design Residue Logarithmic Number System (RLNS) using the One-Hot system”, Research Journal of Applied Sciences, Engineering and Technology, vol. 5, pp. 286-291, January 2013. 
[18] J. N. Mitchell Jr, “Computer Multiplication and Division using Binary Logarithms”, IEEE Transactions on Electronic Computers, vol. EC-11, pp. 512-517, August 1962. 
[19] B. Parhami, Computer Arithmetic: Algorithms and Hardware Design, Oxford University Press, United Kingdom, 2000 
[20] Arash Hariri , Keivan Navi & Reza Rastegar, “A new high dynamic range moduli set with efficient reverse converter”, J. Comput. Math. Appl., vol. 55, pp. 660-668, Februrary 2008. 
[21] B. Cao, C. H. Chang, and T. Srikanthan, “An efficient reverse converter for the 4-moduli set {2n-1, 2n, 2n+1, 22n-1}”, IEEE transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 50, pp. 1296-1303, October 2003. 
[22] B. Cao, C.H. Chang, and T. Srikanthan, “Adder based residue to binary converters for a new balanced 4-moduli set”, in Proc. of the 3rd International Symposium on Image and Signal Processing and Analysis, 2003, p. 820. 
[23] Khalid H Abed, and Raymond E Siferd, “CMOS VLSI implementation of 16-bit logarithm and anti-logarithm converter”, in Proc. of the 43rd IEEE Midwest Symposium on Circuits and Systems, 2000, pp. 776. 
[24] Davide De Caro, Nicola Petra, and Antonio GM Strollo, “Efficient logarithmic converters for digital signal processing applications”, IEEE Transactions on Circuits and systems-II: express briefs, vol. 58, pp. 667-671, 2011. 
[25] M. Arnold, T. Bailey, and J. Cowles, “Error analysis of the Krnetz/Maenner algorithm”, Journal of VLSI signal processing, vol. 33, pp. 37-53, month 2003. 
[26] M. Combet, H. Van Zonneveld, L. Verbeek, “Computation of the Base Two Logarithm of Binary Numbers”, IEEE Transaction on Electronic Computers, vol. EC-14 , pp. 863-867, December 1965. 
[27] E.L Hall, D. D. Lynch, and S. J. Dwyer, “Generation of Products and Quotients Using Approximate Binary Logarithms for Digital Filtering Applications”, IEEE Transaction on Electronic Computers, vol. C-19 , pp. 97-105, February 1970. 
[28] S. L. SanGregory, C. Brothers, D. Gallagher, and R. Siferd, “A Fast, Low-Power Logarithm Approximation with CMOS VLSI Implementation”, in Proc. IEEE Midwest Symp. Circuits and Systems, 1999, pp. 388. 
[29] Khalid H Abed, and Raymond E Siferd, “CMOS VLSI Implementation of a Low-Power Logarithmic Converter”, IEEE Transactions on Computers, vol. 52 , pp. 1421-1433, 2003. 
[30] T. A. Brubaker, J. C. Becker, “Multiplication using logarithms implemented with Read-only-memory”, IEEE Transactions on computers, vol. 24, pp. 761-766, August 1975 
[31] D. M. Lewis, “Interleaved memory function interpolators with application to accurate LNS arithmetic unit”, IEEE Transactions on computers, vol. 43, pp. 974 – 982, August 1994 
[32] F. S. Lai, C. F. E. Wu, “A Hybrid number system processor with geometric and complex arithmetic capabilities”, IEEE Transactions on Computers, vol. 40, pp. 652-662, August 1991. 
[33] Naamatheertham R Samhitha, Neethu Acha Cherian, Pretty Mariam Jacob, and P. Jayakrishnan, “Implementation of 16-bit floating point multiplier using Residue Number System”, in Proc. International Conference on Green Computing, Communication and Conservation of Energy (ICGCE), 2013, p. 195. 
[34] Khalid H Abed, and Raymond E Siferd, “VLSI Implementation of a Low-Power Antilogarithmic Converter”, IEEE Transactions on Computers, vol. 52, pp. 1221-1228, September 2003. 
[35] E. L. Hall, D. D. Lynch, and S. J. Dwyer, “Generation of Products and Quotients Using Approximate Binary Logarithms for Digital Filtering Applications”, IEEE Transaction on Electronic Computers, vol. C-19 , pp. 97-105, February 1970. 
[36] Mehdi Hosseinzadeh, Somayyeh Jafarali Jassbi, and Keivan Navi, “A New Moduli Set {3n-1, 3n+1, 3n +2, 3n - 2} in Residue Number System”, in Proc. 10th International Conference on Advanced Communication Technology (ICACT), 2008, p. 1601. 
[37] H. M. Yassine, “Hierarchical Residue Numbering System suitable for VLSI Arithmetic Architectures”, in Proc. IEEE international symposium on Circuits and Systems, 1992, p. 811. 
[38] M. Abdallah, and A. Skavantzos, “A systematic approach for selecting practical moduli sets for residue number systems”, in Procs of the Twenty-Seventh Southeastern Symposium on System Theory, 1995, p. 445. 
[39] Pazhar Ali , Mizanian Kambiz, Safi Seyyed Mohammad, Taghipour Eivazi Shiva, and Rezael Mehdi, “Fault-Tolerant and Information security in Networks using Multi-level Redundant Residue Number System”, Research Journal of Recent Sciences, vol. 3, pp. 89-92, March 2014. 
[40] Ramya Muralidharan, Chip-Hong Chang, “Area-Power Efficient Modulo 2n-1 and Modulo 2n+1 Multipliers for {2n-1, 2n, 2n+1}”, IEEE Transactions on Circuits and Systems I Regular papers, vol. 59, pp. 2263-2273, October 2012.