The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (2011 vol.60)
pp: 148-156
Fabrizio Lamberti , Politecnico di Torino, Torino
Nikos Andrikos , Politecnico di Torino, Torino
Elisardo Antelo , University of Santiago de Compostela, Santiago de Compostela
Paolo Montuschi , Politecnico di Torino, Torino
ABSTRACT
Two's complement multipliers are important for a wide range of applications. In this paper, we present a technique to reduce by one row the maximum height of the partial product array generated by a radix-4 Modified Booth Encoded multiplier, without any increase in the delay of the partial product generation stage. This reduction may allow for a faster compression of the partial product array and regular layouts. This technique is of particular interest in all multiplier designs, but especially in short bit-width two's complement multipliers for high-performance embedded cores. The proposed method is general and can be extended to higher radix encodings, as well as to any size square and m \times n rectangular multipliers. We evaluated the proposed approach by comparison with some other possible solutions; the results based on a rough theoretical analysis and on logic synthesis showed its efficiency in terms of both area and delay.
INDEX TERMS
Multiplication, Modified Booth Encoding, partial product array.
CITATION
Fabrizio Lamberti, Nikos Andrikos, Elisardo Antelo, Paolo Montuschi, "Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers", IEEE Transactions on Computers, vol.60, no. 2, pp. 148-156, February 2011, doi:10.1109/TC.2010.156
REFERENCES
[1] M.D. Ercegovac and T. Lang, Digital Arithmetic. Morgan Kaufmann Publishers, 2003.
[2] S.K. Hsu, S.K. Mathew, M.A. Anders, B.R. Zeydel, V.G. Oklobdzija, R.K. Krishnamurthy, and S.Y. Borkar, "A 110GOPS/W 16-Bit Multiplier and Reconfigurable PLA Loop in 90-nm CMOS," IEEE J. Solid State Circuits, vol. 41, no. 1, pp. 256-264, Jan. 2006.
[3] H. Kaul, M.A. Anders, S.K. Mathew, S.K. Hsu, A. Agarwal, R.K. Krishnamurthy, and S. Borkar, "A 300 mV 494GOPS/W Reconfigurable Dual-Supply 4-Way SIMD Vector Processing Accelerator in 45 nm CMOS," IEEE J. Solid State Circuits, vol. 45, no. 1, pp. 95-101, Jan. 2010.
[4] M.S. Schmookler, M. Putrino, A. Mather, J. Tyler, H.V. Nguyen, C. Roth, M. Sharma, M.N. Pham, and J. Lent, "A Low-Power, High-Speed Implementation of a PowerPC Microprocessor Vector Extension," Proc. 14th IEEE Symp. Computer Arithmetic, pp. 12-19, 1999.
[5] O.L. MacSorley, "High Speed Arithmetic in Binary Computers," Proc. IRE, vol. 49, pp. 67-91, Jan. 1961.
[6] L. Dadda, "Some Schemes for Parallel Multipliers," Alta Frequenza, vol. 34, pp. 349-356, May 1965.
[7] C.S. Wallace, "A Suggestion for a Fast Multiplier," IEEE Trans. Electronic Computers, vol. EC-13, no. 1, pp. 14-17, Feb. 1964.
[8] D.E. Shaw, "Anton: A Specialized Machine for Millisecond-Scale Molecular Dynamics Simulations of Proteins," Proc. 19th IEEE Symp. Computer Arithmetic, p. 3, 2009.
[9] J.-Y. Kang and J.-L. Gaudiot, "A Simple High-Speed Multiplier Design," IEEE Trans. Computers, vol. 55, no. 10, pp. 1253-1258, Oct. 2006.
[10] J.-Y. Kang and J.-L. Gaudiot, "A Fast and Well-Structured Multiplier," Proc. Euromicro Symp. Digital System Design, pp. 508-515, Sept. 2004.
[11] F. Lamberti, N. Andrikos, E. Antelo, and P. Montuschi, "Speeding-Up Booth Encoded Multipliers by Reducing the Size of Partial Product Array," internal report, http://arith.polito.itir_mbe.pdf, pp. 1-14, 2009.
[12] E.M. Schwarz, R.M. AverillIII, and L.J. Sigal, "A Radix-8 CMOS S/390 Multiplier," Proc. 13th IEEE Symp. Computer Arithmetic, pp. 2-9, 1997.
[13] W.-C. Yeh and C.-W. Jen, "High-Speed Booth Encoded Parallel Multiplier Design," IEEE Trans. Computers, vol. 49, no. 7, pp. 692-701, July 2000.
[14] Z. Huang and M.D. Ercegovac, "High-Performance Low-Power Left-to-Right Array Multiplier Design," IEEE Trans. Computers, vol. 54, no. 3, pp. 272-283, Mar. 2005.
[15] R. Zimmermann and D.Q. Tran, "Optimized Synthesis of Sum-of-Products," Proc. Conf. Record of the 37th Asilomar Conf. Signals, Systems and Computers, vol. 1, pp. 867-872, 2003.
[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. Computers, vol. 45, no. 3, pp. 294-306, Mar. 1996.
[17] P.F. Stelling, C.U. Martel, V.G. Oklobdzija, and R. Ravi, "Optimal Circuits for Parallel Multipliers," IEEE Trans. Computers, vol. 47, no. 3, pp. 273-285, Mar. 1998.
[18] J.-Y. Kang and J.-L. Gaudiot, "A Logarithmic Time Method for Two's Complementation," Proc. Int'l Conf. Computational Science, pp. 212-219, 2005.
[19] K. Hwang, Computer Arithmetic Principles, Architectures, and Design. Wiley, 1979.
[20] R. Hashemian and C.P. Chen, "A New Parallel Technique for Design of Decrement/Increment and Two's Complement Circuits," Proc. 34th Midwest Symp. Circuits and Systems, vol. 2, pp. 887-890, 1991.
[21] D. Gajski, Principles of Digital Design. Prentice-Hall, 1997.
[22] STMicroelectronics, "130nm HCMOS9 Cell Library," http://www.st.com/stonline/products/technologies/ socevol.htm, 2010.
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool