
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
JungYup Kang, JeanLuc Gaudiot, "A Simple HighSpeed Multiplier Design," IEEE Transactions on Computers, vol. 55, no. 10, pp. 12531258, October, 2006.  
BibTex  x  
@article{ 10.1109/TC.2006.156, author = {JungYup Kang and JeanLuc Gaudiot}, title = {A Simple HighSpeed Multiplier Design}, journal ={IEEE Transactions on Computers}, volume = {55}, number = {10}, issn = {00189340}, year = {2006}, pages = {12531258}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2006.156}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Simple HighSpeed Multiplier Design IS  10 SN  00189340 SP1253 EP1258 EPD  12531258 A1  JungYup Kang, A1  JeanLuc Gaudiot, PY  2006 KW  Multiplier KW  Booth KW  modified Booth KW  partial products. VL  55 JA  IEEE Transactions on Computers ER   
[1] Artisan Components, TSMC $0.13\mu{\rm m}$ Process CL013LV 1.2Volt SAGEX Standard Cell Library Databook. Artisan Components, Oct. 2001.
[2] A.D. Booth, “A Signed Binary Multiplication Technique,” Quarterly J. Mechanical and Applied Math., vol. 4, pp. 236240, 1951.
[3] D.P. Agrawal and T.R.N. Rao, “On Multiple Operand Addition of Signed Binary Numbers,” IEEE Trans. Computers, vol. 27, pp. 10681070, Nov. 1978.
[4] L. Dadda, “Some Schemes for Parallel Multiplier,” Alta Frequenza, vol. 34, pp. 349356, 1965.
[5] F. Elguibaly, “A Fast Parallel MultiplierAccumulator Using the Modified Booth Algorithm,” IEEE Trans. Circuits and Systems, vol. 47, no. 9, pp. 902908, 2000.
[6] M.D. Ercegovac and T. Lang, Digital Arithmetic. Los Altos, Calif.: Morgan Kaufmann, 2003.
[7] J. FadaviArdekani, “M x N Booth Encoded Multiplier Generator Using Optimized Wallace Trees,” IEEE Trans. Very Large Scale Integration, vol. 1, no. 2, pp. 120125, 1993.
[8] A. Farooqui and V. Oklobdzija, “General DataPath Organization of a MAC Unit for VLSI Implementation of DSP Processors,” Proc. 1998 IEEE Int'l Symp. Circuits and Systems, vol. 2, pp. 260263, 1998.
[9] D. Gajski, Principles of Digital Design. Prentice Hall, 1997.
[10] 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. 887890, 1991.
[11] Z. Huang and M. Ercegovac, “HighPerformance LefttoRight Array Multiplier Design,” Proc. 16th Symp. Computer Arithmetic, pp. 411, June 2003.
[12] K. Hwang, Computer Arithmetic Principles, Architecture, and Design. New York: Wiley, 1979.
[13] N. Itoh, Y. Naemura, H. Makino, Y. Nakase, T. Yoshihara, and Y. Horiba, “A 600MHz 54x54bit Multiplier with RectangularStyled Wallace Tree,” IEEE J. SolidState Circuits, vol. 36, no. 2, pp. 249257, 2001.
[14] J.Y. Kang and J.L. Gaudiot, “A Fast and WellStructured Multiplier,” EUROMICRO Symp. Digital System Design, pp. 508515, Aug. 2004.
[15] J.Y. Kang, W.H. Lee, and T.D. Han, “A Design of a Multiplier Module Generator Using 42 Compressor,” Proc. Korea Inst. of Telematics and Electronics (KITE) Fall Conf., vol. 16, pp. 388392, 1993.
[16] M. Nagamatsu, S. Tanaka, J. Mori, T. Noguchi, and K. Hatanaka, “A 15ns 32x32bit CMOS Multiplier with an Improved Parallel Structure,” Digest of Technical Papers, IEEE Custom Integrated Circuits Conf., 1989.
[17] 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. 294306, Mar. 1996.
[18] D.A. Patterson and J.L. Hennessy, Computer Architecture: A Quantitative Approach. San Mateo, Calif.: Morgan Kaufmann, 1996.
[19] M.R. Santoro and M. Horowitz, “SPIM: A Pipelined 64x64bit Iterative Multiplier,” IEEE Trans. Circuits and Systems, vol. 24, no. 2, pp. 487493, 1989.
[20] N. Slingerland and A.J. Smith, “Measuring the Performance of Multimedia Instruction Sets,” IEEE Trans. Computers, vol. 51, no. 11, pp. 13171332, 2002.
[21] 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. 273285, Mar. 1998.
[22] Sy nopsys. Design Compiler User's Guide, http:/www.synopsys. com/, 2004.
[23] D. Villeger and V. Oklobdzija, “Analysis of Booth Encoding Efficiency in Parallel Multipliers Using Compressors for Reduction of Partial Products,” Proc. 27th Ann. Asilomar Conf. Signals, Systems, and Computers, vol. 1, pp. 781784, 1993.
[24] C.S. Wallace, “A Suggestion for a Fast Multiplier,” IEEE Trans. Computers, vol. 13, no. 2, pp. 1417, 1964.
[25] A. Weinberger, “4:2 CarrySave Adder Module,” IBM Technical Disclosure Bull., vol. 23, 1981.
[26] W.C. Yeh and C.W. Jen, “HighSpeed Booth Encoded Parallel Multiplier Design,” IEEE Trans. Computers, vol. 49, no. 7, pp. 692701, July 2000.