We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
Reseach Article

High Speed-Low Power Radix-8 Booth Decoded Multiplier

by Praveen Kumar Patil, Laxmi Kumre
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 73 - Number 14
Year of Publication: 2013
Authors: Praveen Kumar Patil, Laxmi Kumre
10.5120/12812-0154

Praveen Kumar Patil, Laxmi Kumre . High Speed-Low Power Radix-8 Booth Decoded Multiplier. International Journal of Computer Applications. 73, 14 ( July 2013), 42-45. DOI=10.5120/12812-0154

@article{ 10.5120/12812-0154,
author = { Praveen Kumar Patil, Laxmi Kumre },
title = { High Speed-Low Power Radix-8 Booth Decoded Multiplier },
journal = { International Journal of Computer Applications },
issue_date = { July 2013 },
volume = { 73 },
number = { 14 },
month = { July },
year = { 2013 },
issn = { 0975-8887 },
pages = { 42-45 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume73/number14/12812-0154/ },
doi = { 10.5120/12812-0154 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:40:07.089179+05:30
%A Praveen Kumar Patil
%A Laxmi Kumre
%T High Speed-Low Power Radix-8 Booth Decoded Multiplier
%J International Journal of Computer Applications
%@ 0975-8887
%V 73
%N 14
%P 42-45
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper proposed a new method for adding sum and carry using carry look-ahead adder at the final stage of the radix-8 booth decoding multiplier. In a conventional radix-8 booth decoded multiplier, full adders and half adders are used to add sum and carry. After partial product reduction using booth decoding, the partial product rows are required to add for final result. In this method carry look-ahead adders (CLAs) are used to add reduced partial product generated after decoding the multiplier bits. The carry look-ahead adder generates the carry and sum simultaneously. 5 bit and 8 bit carry look-ahead adders are used to add reduced partial product terms in proposed circuit. The proposed method is used to implement 8bit multiplication using radix-8 booth decoded multiplier. The circuit is designed and simulated using cadence virtuoso EDA tool at 180nm CMOS technology. Simulation results shows power reduction by 11. 48 % and propagation delay reduction by 33. 06 % as compared to conventional method.

References
  1. Jiun-Ping Wang, Shiann-Rong Kuang, Shish Chang Liang, "High Accuracy Fixed Width Modified Booth Multipliers for Lossy Applications", IEEE Trans 2011.
  2. Pouya Asadi and Keivan Navi, "A new low power 32×32 bit multiplier", World Applied Sciences Journal 2 (4): 341-347,2007.
  3. A. D. Booth, "A signed binary multiplication technique", Quart. J. Mech. Appl. Marh, vol. 4, pp. 236-240, 1951. (Reprinted in [8, pp. 100-104])
  4. Razaidi Hussin, Ali Yeon Md. Shakaff, Norina Idris, Zaliman Sauli, Rizala fande CheIIsmail, and Afzan Kamaraudin, "An efficient modified Booth multiplier architecture", International Conference on Electronics Design, 978-1-4244-2315-6/08, 2008 IEEE.
  5. Ramya Muralidharan, Chip Hong Chang," Radix-4 and Radix-8 Booth encoded multi-modulas multipliers" IEEE Trans, 2013.
  6. Vignesh Kumar R. , Kamala J. , "High Accuracy Fixed Width Multipliers using Modified Booth Algorithm",International Conference on Modeling Optimization and Computing, Procedia Engineering 38(2012) 2491-2498.
  7. Aparna P R, Nisha Thomas, "Design and implementation of a High performance multiplier using HDL", IEEE 2012.
  8. Yajuan He, Chip Hong Chang,"A New Redundant Binary Booth Encoding for Fast 2n-Bit Multiplier Design", IEEE Trans 2009.
  9. Philip E. Madrid, Brian Millar, Earl E. Swartzlander, "Modified Booth Algorithm for High Radix Fixed Point Multiplication", IEEE Trans 1993.
  10. Gary W. Bewick, " Fast Multiplication: Algorithms and Implementation" CSL-TR-94-617, Feb 1994.
  11. Ravindra P Rajput, M. N. Shanmukha Swamy, "High speed Modified Booth Encoder multiplier for signed and unsigned numbers", IEEE 2012.
  12. JUMP. J. R. , and AHUJA,S. R. , "Effective pipelining of digital systems", IEEE Trans. , 1978, C-27, PP. 855-865.
  13. Nirlakalla Ravi, T. Subba Rao, B. Bhaskara Rao, T. Jayachandra Prasadd, "A New Reduced Multiplication Structure for Low Power and Low Area Modified Booth Encoding Mulriplier", International Conference on Modeling Optimization and Computing, Procedia Engineering 38(2012) 2787-2771.
Index Terms

Computer Science
Information Sciences

Keywords

Booth Multiplier Radix-8 Booth Decoder Partial Product Carry Look-ahead Adder