Approximate Radix-4 Booth Multipliers for Error Analysis

Authors(2) :-M. Sainath, P. Muralikrishna

The multiplication operation is found in many elements of a digital machine or digital computer, most appreciably in sign processing, portraits and scientific computation. With advances in era, diverse strategies have been proposed to layout multipliers, which give high speed, low power intake and lesser region.. Approximate radix-4 modified Booth encoding (MBE) algorithms and a regular partial product array that employs an approximate Wallace tree this quick gives Approximate booth multiplier layout the usage of the radix4 modified Booth encoders R4ABE1 and R4ABE2. The use of those sales space encoders we layout the approximate multipliers .In this approximate multipliers generate the mistakes the usage of NMED error tolerant computing is analyzed via using two approximate Booth encoders with recognize to approximate component. Results are shown in XILINX 14.3 ISE.

Authors and Affiliations

M. Sainath
M.Tech Student, Department of ECE, SKU College of Engineering, Anathapur, Andhra Pradesh, India
P. Muralikrishna
Assistant Professor, Department of ECE, SKU College of Engineering, Anathapur, Andhra Pradesh, India

Radix-4 multiplier, Booth encoder, approximate computing, low power.

  1. S Venkataramani, S. T. Chakradhar, and K. Roy. "Computing approximately, and efficiently," Proc. Design, Automation & Test in Europe Conference & Exhibition (DATE), 2015, pp.748-751.
  2. J Han and M. Orshansky, "Approximate computing: an emerging paradigm for energy-efficient design," Proc. 18th IEEE European Test Symposium, 2013, pp.1-6.
  3. H Mahdiani, A. Ahmadi, S. Fakhraie, and C. Lucas, "Bio-inspired imprecise computational blocks for efficient VLSI implementation of soft-computing applications," IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 57, pp. 850-862, 2010.
  4. V Gupta, D. Mohapatra, S. Park, A. Raghunathan, and K. Roy, "IMPACT: IMPrecise Adders for Low-Power Approximate Computing," Proc. Int. Symp. Low Power Electronics and Design (ISLPED), pp. 1-3, 2011.
  5. W Liu, L. Chen, C. Wang, M. O'Neill and F. Lombardi, "Design and analysis of floating-point adders", IEEE Trans. Computers, vol. 65, pp. 308-314, Jan. 2016.
  6. J Liang, J. Han, and F. Lombardi, "New metrics for the reliability of approximate and probabilistic adders," IEEE Trans. Computers, vol. 63, pp. 1760-1771, Sep. 2013.
  7. A Booth, "A signed binary multiplication technique," Quarterly J. Mechanics and Applied Mathematics, vol. 4, pp/236-240, June 1951.
  8. O MacSorley, High-speed arithmetic in binary computers, Proc. IRE, vol. 49, pp. 67-91, 1961.
  9. K-J. Cho, K.-C. Lee, J.-G. Chung, and K. K. Parhi, "Design of low error fixed-width modified Booth multiplier," IEEE Trans. VLSI Systems, vol. 12, no. 5, pp. 522-531, 2004.
  10. M. J. Schulte and E. E. Swartzlander Jr., "Truncated multiplication with correction constant," Proc. Workshop VLSI Signal Process. VI, 1993, pp. 388-396.

Publication Details

Published in : Volume 3 | Issue 6 | July-August 2018
Date of Publication : 2018-08-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 535-541
Manuscript Number : CSEIT183698
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

M. Sainath, P. Muralikrishna, "Approximate Radix-4 Booth Multipliers for Error Analysis", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 6, pp.535-541, July-August-2018.
Journal URL :

Article Preview

Follow Us

Contact Us