Low power and high speed multiplier design with row bypassing and parallel architecture

被引:21
作者
Kuo, Ko-Chi [1 ]
Chou, Chi-Wen [1 ]
机构
[1] Natl Sun Yat Sen Univ, Dept Comp Sci & Engn, Kaohsiung, Taiwan
关键词
Low power; Bypassing multiplier; Parallel architecture; Ripple carry array; HIGH-PERFORMANCE; REDUCTION;
D O I
10.1016/j.mejo.2010.06.009
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper presents a low power and high speed row bypassing multiplier. The primary power reductions are obtained by tuning off MOS components through multiplexers when the operands of multiplier are zero. Analysis of the conventional DSP applications shows that the average of zero input of operand in multiplier is 73.8 percent. Therefore, significant power consumption can be reduced by the proposed bypassing multiplier. The proposed multiplier adopts ripple-carry adder with fewer additional hardware components. In addition, the proposed bypassing architecture can enhance operating speed by the additional parallel architecture to shorten the delay time of the proposed multiplier. Both unsigned and signed operands of multiplier are developed. Post-layout simulations are performed with standard TSMC 0.18 mu m CMOS technology and 1.8 V supply voltage by Cadence Spectre simulation tools. Simulation results show that the proposed design can reduce power consumption and operating speed compared to those of counterparts. For a 16 x 16 multiplier, the proposed design achieves 17 and 36 percent reduction in power consumption and delay, respectively, at the cost of 20 percent increase of chip area in comparison with those of conventional array multipliers. In addition, the proposed design achieves averages of 11 and 38 percent reduction in power consumption and delay with 46 percent less chip area in comparison with those counterparts for both unsigned and signed multipliers. The proposed design is suitable for low power and high speed arithmetic applications. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:639 / 650
页数:12
相关论文
共 27 条
[11]   Low power multiplication algorithm for switching activity reduction through operand decomposition [J].
Ito, M ;
Chinnery, D ;
Keutzer, K .
21ST INTERNATIONAL CONFERENCE ON COMPUTER DESIGN, PROCEEDINGS, 2003, :21-26
[12]   Subthreshold leakage modeling and reduction techniques [J].
Kao, J ;
Narendra, S ;
Chandrakasan, A .
IEEE/ACM INTERNATIONAL CONFERENCE ON CAD-02, DIGEST OF TECHNICAL PAPERS, 2002, :141-148
[13]  
Kim NS, 2003, COMPUTER, V36, P68, DOI 10.1109/MC.2003.1250885
[14]   High performance low power away multiplier using temporal tiling [J].
Mahant-Shetti, SS ;
Balsara, PT ;
Lemonds, C .
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 1999, 7 (01) :121-124
[15]   Exploring multiplier architecture and layout for low power [J].
Meier, PCH ;
Rutenbar, RA ;
Carley, LR .
PROCEEDINGS OF THE IEEE 1996 CUSTOM INTEGRATED CIRCUITS CONFERENCE, 1996, :513-516
[16]  
MUDASSIR R, 2005, P IEEE INT NEWCAS C, P259
[17]   A novel low-power full-adder cell with new technique in designing logical gates based on static CMOS inverter [J].
Navi, K. ;
Foroutan, V. ;
Azghadi, M. Rahimi ;
Maeen, M. ;
Ebrahimpour, M. ;
Kaveh, M. ;
Kavehei, O. .
MICROELECTRONICS JOURNAL, 2009, 40 (10) :1441-1448
[18]  
Ohban J, 2002, APCCAS 2002: ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, VOL 2, PROCEEDINGS, P13, DOI 10.1109/APCCAS.2002.1115097
[19]   A method for speed optimized partial product reduction and generation of fast parallel multipliers using an algorithmic approach [J].
Oklobdzija, VG ;
Villeger, D ;
Liu, SS .
IEEE TRANSACTIONS ON COMPUTERS, 1996, 45 (03) :294-306
[20]  
Parhami Behrooz, 2010, Computer Arithmetic Algorithms and Hardware Designs