Scholarly Research Excellence

Digital Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29140


Select areas to restrict search in scientific publication database:
10008706
Analytical Comparison of Conventional Algorithms with Vedic Algorithm for Digital Multiplier
Abstract:
In today’s scenario, the complexity of digital signal processing (DSP) applications and various microcontroller architectures have been increasing to such an extent that the traditional approaches to multiplier design in most processors are becoming outdated for being comparatively slow. Modern processing applications require suitable pipelined approaches, and therefore, algorithms that are friendlier with pipelined architectures. Traditional algorithms like Wallace Tree, Radix-4 Booth, Radix-8 Booth, Dadda architectures have been proven to be comparatively slow for pipelined architectures. These architectures, therefore, need to be optimized or combined with other architectures amongst them to enhance its performances and to be made suitable for pipelined hardware/architectures. Recently, Vedic algorithm mathematically has proven to be efficient by appearing to be less complex and with fewer steps for its output establishment and have assumed renewed importance. This paper describes and shows how the Vedic algorithm can be better suited for pipelined architectures and also can be combined with traditional architectures and algorithms for enhancing its ability even further. In this paper, we also established that for complex applications on DSP and other microcontroller architectures, using Vedic approach for multiplication proves to be the best available and efficient option.
Digital Object Identifier (DOI):

References:

[1] H. Jiang, J. Han, F. Qiao and F. Lombardi, “Approximate Radix-8 Booth Multipliers for Low-Power and High-Performance Operation”, IEEE Trans. Computers, vol. 65, no. 8, pp. 2638-2644, Aug. 2016.
[2] R. S. Waters and E. E. Swartzlander, “A Reduced Complexity Wallace Multiplier Reduction,” IEEE Trans. Computers, vol. 59, no. 9, pp. 1134-1137, Aug. 2010.
[3] K. Tsoumanis, S. Xydis, C. Efstathiou, N. Moschopoulos and K. Pekmestzi, “An Optimized Modified Booth Recoder for Efficient Design of the Add-Multiply Operator”, IEEE Trans. Circuits and Systems I, vol. 61, no. 4, pp.1133-1143, 2014.
[4] W. Liu, L. Qian, C. Wang. H. Jiang, J. Han, F. Lombardi, “Design of Approximate Radix-4 Booth Multipliers for Error-Tolerant Computing", IEEE Trans. Computers, vol. 66, no. 8, pp.1435-1441, 2017.
[5] N. Sureka, R. Porselvi and K. Kumuthapriya, “An Efficient High Speed Wallace Tree Multiplier”, IEEE International Conference on Information Communication and Embedded Systems (ICICES), pp. 1023-1026, 2013.
[6] B. Jeevan, S. Narendar, Dr. C.V. Krishna Reddy, Dr. K. Sivani, “A High Speed Binary Floating Point Multiplier Using Dadda Algorithm”, 2013 International Multi-Conference on Automation, Computing, Communication, Control and Compressed Sensing(iMac4s), pp. 455-460, 2013.
[7] Vinod Budhe, Prasanna Palsodkar, Prachi Palsodakar, “Design and Verification of Dadda Algorithm Based Binary Floating Point Multiplier”, 2014 International Conference on Communication and Signal Processing, pp. 1073-1077, 2014.
[8] K. B. Jaiswal, N. Kumar V, and P. Seshadri, Lakshminarayanan G., “Low Power Wallace Tree Multiplier Using Modified Full Adder”, IEEE International Conference on Signal Processing, Communication and Networking (ICSCN), pp. 1-4, 2015.
[9] Manjunath, V. Harikaran, K. Manikanta, Sivananthan S. and Sivasankaran K., “Design and Implementation of 16x16 Modified Booth Multiplier”, IEEE Online International Conference on Green Engineering and Technologies (IC-GET), pp. 1-5, 2015.
[10] S. Asif and Y. Kong, “Performance Analysis of Wallace and Radix-4 Booth-Wallace Multipliers”, IEEE Electronic System Level Synthesis Conference (ESLsyn), pp. 17-22, 2015.
[11] Srini Devadas, “Introduction to Algorithms,” Lecture 11: Integer Arithmetic, Karatsuba Multiplication, MIT Open Course Ware, Massachusetts Institute of Technology, 6.006, Fall 2011. Available at: https://www.youtube.com/watch?v=eCaXlAaN2uE.
[12] A. Mehta, C. B. Bidhul, S. Joseph and Jayakrishnan P., “Implementation of Single Precision Floating Point Multiplier using Karatsuba Algorithm”, International Conference on Green Computing, Communication and Conservation of Energy (ICGCE), pp. 254-256, 2013.
[13] K. Shruthilaya and M. Vinoth, “Power Estimation of Modified Booth Recoder for Efficient Add-Multiply Operator”, IEEE Conference on Computing for Sustainable Global Development (INDIACom), pp. 1684-1689, 2015.
[14] R. Pratibha, P. Sandhya, and R. Varun, “Design of High Performance and Low Power Multiplier using Modified Booth Encoder”, IEEE International Conference on Electrical, Electronics and Optimization Techniques (ICEEOT), pp. 794-798, 2016.

Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007