ACM Home Page
Please provide us with feedback. Feedback
ByZFAD: a low switching activity architecture for shift-and-add multipliers
Full text PdfPdf (234 KB)
Source SBCCI archive
Proceedings of the 19th annual symposium on Integrated circuits and systems design table of contents
Ouro Preto, MG, Brazil
SESSION: Digital and low power design table of contents
Pages: 179 - 183  
Year of Publication: 2006
ISBN:1-59593-479-0
Authors
Mohammad D. Mottaghi  University of Tehran, Tehran, Iran
Ali Afzali Kusha  University of Tehran, Tehran, Iran
Zainanabedin Navabi  Northeastern University, Boston
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 30,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1150343.1150390
What is a DOI?

ABSTRACT

In this paper, a low-power architecture (ByZFAD Stands for Bypass Zero, Feed A Directly) for shift-and-add multipliers is proposed. The architecture considerably lowers the switching activity of conventional multipliers. The modifications include the removal of the shift of B register, direct feeding of A to the adder, bypassing the adder whenever possible, using a ring counter instead of the binary counter, and removal of the partial product shift. To show the efficiency of the architecture, we have compared the switching activity of the proposed architecture with that of the conventional architecture for a radix-2 shift-and-add multiplier. The results for a 32-bit multiplier show that, the proposed architecture lowers the total switching activity up to 76% when compared to the traditional architecture.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
A. Chandrakasan, "Low-power CMOS digital design", IEEE J. Solid-State Circ., vol. 27, no. 4, April 1992, pp. 473--484.
 
2
A. Chandrakasan, "Design of portable systems," Proc. IEEE 1994 CICC, pp. 12.1.1--12.1.8.
 
3
Nan-Ying Shen, Chen.O.T., "Low-power multipliers by minimizing switching activities of partial products", ISCAS 2002. IEEE International Symposium on Circuits and Systems, vol.4, pp. 93--96, May 2002.
 
4
O.T. Chen, S. Wang, and Yi-Wen Wu, "Minimization of switching activities of partial products for designing low-power multipliers", IEEE Transactions on VLSI Systems, vol. 11, pp. 418--433, June 2003.
 
5
C. Nagendra, "Power Delay characteristics of CMOS Adders," IEEE trans, VLSI systems, vol. 2, no. 3, Sept. 1994, pp. 377--381.
 
6
B. Parhami, Computer Arithmetic Algorithms and Hardware Designs. Oxford university press, 1st edition, 2000.
 
7
L. Junming, "A novel 10-transistor lowpower high-speed full adder cell", Proc. International Conference on Solid-State and Integrated Circuit Technology, 2001, pp. 1155--1158.
 
8
M. D. Mottaghi, "Low-power ring counter based of hot-block architecture," to be published
 
9
S.-W. Heo, M.-G. Kim, and Y.-S. Lee, "Study of optimized adder selection," Proc. 5th International Conference on ASIC, vol. 2, pp. 586--590, Oct. 2003.
 
10
A. Sayed and H. Al-Asaad, "Survey and evaluation of low-power full-adder cells," Proc. 5th International Conference on ASIC, vol. 2, pp. 201--206, Oct. 2002.
 
11
A. Shams and M. Bayoumi, "A novel high-performance CMOS 1-Bit full-adder cell", IEEE Transactions on Circuits and Systems-II: Analog and Digital Signal Processing, vol. 47, pp. 478--481, May 2000.
 
12
H. A. Mahmoud and M. Bayoumi, "A 10-transistor low-power high-speed full adder cell," Proc. International Symposium on Circuits and Systems, 1999, pp. 43--46.

Collaborative Colleagues:
Mohammad D. Mottaghi: colleagues
Ali Afzali Kusha: colleagues
Zainanabedin Navabi: colleagues