Asic Implementation of Energy Efficient Reduced Size Array Multiplier

International Journal of Electrical and Electronics Engineering

© 2018 by SSRG - IJEEE Journal

Volume 5 Issue 2

Year of Publication : 2018

Authors : K.Jayasurya, M.Sangeetha

10.14445/23488379/IJEEE-V5I2P103

How to Cite?

K.Jayasurya, M.Sangeetha, "Asic Implementation of Energy Efficient Reduced Size Array Multiplier," SSRG International Journal of Electrical and Electronics Engineering, vol. 5,  no. 2, pp. 12-17, 2018. Crossref, https://doi.org/10.14445/23488379/IJEEE-V5I2P103

Abstract:

A highly efficient carry free multiplication plays a vital role in arithmetic operations. A special addition mechanism employed in the proposed work processes the bits from higher order to lower order i.e. from most significant bit to least significant bit is used for improving the performance of the multiplier by reducing the critical path delay. This left to right mode operation results in the reduction of partial products. This is achieved by effectively using on-the fly conversion (OTFC) along with radix-4 full adders. It also results in discarding final addition in the most significant part during the ripple carry addition in the least significant part. This minimizes overall delay of the multiplier compared with the conventional partial product generation. The proposed LRRS (left-to-right reduced size) multiplier is implemented with optimized on-the fly conversion circuit to reduce the multiplier complexity. Compared with conventional left-to-right multipliers the proposed full length multiplier and its truncated version results in reduction of area, power and delay. Finite Impulse Response filter involves multiplications, additions and shifting operations. As the multiplier is the slowest element in the system, it will affect the performance of the FIR filter. In this case, the reduced size, energy-efficient left-to-right array multiplier is designed which reduces the area, power and delay of the multiplier unit. Therefore the area is reduced with the increase in speed of operation and low power consumption in the multiplier unit of FIR filter which serves as the Application Specific IC.

Keywords:

Left-to-right reduced size, on-the fly conversion, array reduction, truncated multiplier, FIR Filter.

References:

[1] Z. Shun, O. A. Pfander, H. J. Pfleiderer, and A. Bermak, “A VLSI architecture for a run-time multi-precision reconfigurable booth multiplier,” in Proc. 14th IEEE Int. Conf. Circuits Syst., pp. 975–978, 2007. 
[2] K.Sucharitha, P. Rahul Reddy,"An Efficient Implementation of Multipliers for ASIC Implementations",International Journal of VLSI & Signal Processing (SSRG-IJVSP),Volume3 Issue 1, 2016. 
[3] M. de la Guia Solaz, W. Han, and R. Conway, “A flexible low power DSP with a programmable truncated multiplier,” IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 59, no. 11, pp. 2555–2568, 2012. 
[4] Y.RamaLakshmanna, G.V.S.Padma Rao, N . Udaya Kumar, K. Bala Sindhuri," A Survey on Different Multiplier Techniques" International Journal of Electronics and Communication Engineering (SSRG - IJECE),Volume 3 Issue 3 2016. 
[5] J. Chen, C. H. Chang, F. Feng, W. Ding, and J. Ding, “Novel design algorithm for low complexity programmable FIR filters based on extended double base number system,” IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 62, no. 1, pp. 224–233, 2015. 
[6] Surendra Verma, Dr. K C Mahajan,"A Survey on Energy Efficient Routing Protocols for Wireless Sensor Networks & Comparative analysis with USEP",International Journal of Electronics and Communication Engineering, Volume-3 Issue-10 2016. 
[7] M. C. Wen, S. J. Wang, and Y. N. Lin, “Low power parallel multiplier with column bypassing,” in Proc. IEEE Int. Symp. Circuits Syst., pp. 1638–1641, 2005. 
[8] M. Ahuja and Sakshi, “Design and analysis of bypassing multiplier,” in Proc. 5th Int. Conf. ARTCom, pp. 241–246, 2013. 
[9] M. D. Ercegovac and T. Lang, “Fast multiplication without carrypropagate addition,” IEEE Trans. Comput., vol. 39, no. 11, pp. 1385–1390, Nov. 1990. 
[10] L. Ciminiera and P. Montuschi, “Carry-save multiplication schemes without final addition,” IEEE Trans. Comput., vol. 45, no. 9, pp. 1050–1055, 1996. 
[11] M. D. Ercegovac and T. Lang, “On-the-fly conversion of redundant into conventional representation,” IEEE Trans. Comput., vol. C-36, no. 7, pp. 895–897, 1987. 
[12] S. Das and S. P. Khatri, “Generation of the optimal bit-width topology of the fast hybrid adder in a parallel multiplier,” in Proc. IEEE Int. Conf. Integr. Circuit Des. Technol., pp. 1–6, May 2009. 
[13] L. Ciminiera and P. Montuschi, “Carry-save multiplication schemes without final addition,” IEEE Trans. Comput., vol. 45, no. 9, pp. 1050–1055, 2002. 
[14] M. C. Wen, S. J. Wang, and Y. N. Lin, “Low power parallel multiplier with column bypassing,” in Proc. IEEE Int. Symp. Circuits Syst., pp. 1638–1641, 2010. 
[15] N. Takagi and T. Horiyama, “A high-speed reduced-size adder under left-to-right input arrival,” IEEE Trans. Comput., vol. 48, no. 1, pp. 76–80,Jan.2000. 
[16] V. G. Oklobdzija, D. Villeger, and S. S. Liu, “A method for speed optimized partial product reduction and generation of fast parallel multipliers using an algorithmic approach,” IEEE Trans. Comput., vol. 45, no. 3, pp. 294–306, Mar. 2012. 
[17] A. Vazquez and E. Antelo, “Area and delay evaluation model for CMOS circuits,” Internal Report, Univ. Santiago de Compostela (Spain), Jun. 2012. 
[18] M. L. Hsia and O. T. C. Chen, “Low-power multiplier optimized by partial-product summation and adder cells,” in Proc. IEEE Int. Conf. Circuits Syst., pp. 3042–3045, 2011.