Implementation of 24 Bit Multiplier Using Parallel Multiplication with Sorting Based Binary Counters for VLSI Applications

Authors

  • Amtul Saboor  M.tech Scholar, Department of ECE (VLSI & EMBEDDED SYSTEM), Sharanbasva University, Kalaburgi, India.
  • Renuka.B.J  Assistant Professor, Department of ECE, Sharanbasva University, Kalaburgi, India.

Keywords:

Binary counters, sorting network, approximate 4:2 compressor, 24 bit multiplier, one-hot code.

Abstract

This project consists of an innovative way of rapid counters such as (7, 3), (15, 4) etc., binary counters and approximate (4:2) compressors which is based on sorting network. For improving the speed, a high compressor counters need to be employed. The counter inputs are divided asymmetrically into two pieces and then fed into sorting networks as inputs to construct sequences that are represented solely by one-hot code sequences. We can develop and further refine the (7, 3) counter using this method, which outperforms alternative designs in terms of latency, overall area, and power consumption in the vast majority of circumstances. A (15, 4) counter is developed, and it has a lower latency despite using less power and taking up less space. In addition, using a sorting network, we create approximation compressors (4:2). They built an 8 x 8, 16 x 16 bit multiplier to examine the performance of the circuits they constructed. A 24Bit multiplier is made and the effectiveness of the design is synthesized and simulated using Xilinx Vivado.

References

  1. C. S. Wallace, A suggestion for a fast multiplier, IEEE Trans.Electron. Comput., vol. EC-13, no. 1, pp. 14–17, Feb. 1964, doi:10.1109/PGEC.1964.263830.
  2. R. S. Waters and E. E. Swartzlander,  A reduced complexity Wallace multiplier reduction,  IEEE Trans. Comput., vol. 59, no. 8,pp. 1134–1137, Aug. 2010, doi: 10.1109/TC.2010.103.
  3. P. L. Montgomery,  Five, six, and seven-term karatsuba-like formulae, IEEE Trans. Comput., vol. 54, no. 3, pp. 362–369, Mar. 2005, doi:10.1109/TC.2005.49.
  4. S. Asif and Y. Kong, Analysis of different architectures of counter based Wallace multipliers, in Proc. 10th Int. Conf. Comput. Eng. Syst. (ICCES), Cairo, Egypt, Dec. 2015, pp. 139–144, doi: 10.1109/ICCES.2015.7393034.
  5. S. Asif and Y. Kong, Design of an algorithmic Wallace multiplier using high speed counters, in Proc. 10th Int. Conf. Comput. Eng. Syst. (ICCES), Cairo, Egypt, Dec. 2015, pp. 133–138, doi:10.1109/ICCES.2015.7393033.
  6. C. Fritz and A. T. Fam, Fast binary counters based on symmetric stacking, IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 25, no. 10, pp. 2971–2975, Oct. 2017, doi: 10.1109/TVLSI.2017.2723475.10.1109/EDSSC.2017.8126527.
  7. M. Mehta, V. Parmar, and E. Swartzlander, High-speed multiplier design using multi-input counter and compressor circuits, in Proc.10th IEEE Symp. Comput. Arithmetic, Grenoble, France, Jun. 1991, pp. 43–50, doi: 10.1109/ARITH.1991.145532.
  8. A. Fathi, B. Mashoufi, and S. Azizian, Very fast, high-performance 5-2 and 7-2 compressors in CMOS process for rapid parallel accumulations, IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 28, no. 6, pp. 1403–1412, Jun. 2020, doi: 10.1109/TVLSI.2020.2983458.
  9. A. G. M. Strollo, E. Napoli, D. De Caro, N. Petra, and G. D. Meo, Comparison and extension of approximate 4-2 compressors for low-power approximate multipliers, IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 67, no. 9, pp. 3021–3034, Sep. 2020, doi: 10.1109/TCSI.2020.2988353.

Downloads

Published

2022-08-30

Issue

Section

Research Articles

How to Cite

[1]
Amtul Saboor, Renuka.B.J "Implementation of 24 Bit Multiplier Using Parallel Multiplication with Sorting Based Binary Counters for VLSI Applications" International Journal of Scientific Research in Science and Technology(IJSRST), Online ISSN : 2395-602X, Print ISSN : 2395-6011,Volume 9, Issue 4, pp.312-317, July-August-2022.