ASIC design of a high speed low power circuit for factorial calculation using ancient Vedic mathematics

被引:29
作者
Saha, P. [2 ]
Banerjee, A. [3 ]
Dandapat, A. [4 ]
Bhattacharyya, P. [1 ]
机构
[1] Bengal Engn & Sci Univ, Dept Elect & Telecommun Engn, Howrah 711103, W Bengal, India
[2] Bengal Engn & Sci Univ, Sch VLSI Technol, Howrah 711103, W Bengal, India
[3] JIS Coll Engn, Dept Elect & Commun Engn, Kalyani 741235, W Bengal, India
[4] Jadavpur Univ, Dept Elect & Telecommun Engn, Kolkata 700032, India
关键词
Vedic multiplier; Incrementer; Zero detectors; Decrementer; Factorial design; High speed;
D O I
10.1016/j.mejo.2011.09.001
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
ASIC design of a high speed low power circuit for factorial calculation of a number is reported in this paper. The factorial of a number can be calculated using iterative multiplication by incrementing or decrementing process and iterative multiplication can be computed through parallel implementation methodology. Parallel implementation along with Vedic multiplication methodology for calculation of factorial of a number ensures significant reduction in propagation delay and switching power consumption due to reduction of stages in multiplication process, in comparison with the conventionally used Vedic multiplication methodologies like 'Urdhva-tiryakbyham' (UT) and 'Nikhilam Navatascaramam Dasatah' (NND) based implementation methodology. Transistor level implementation was carried out using spice specter with standard 90 nm CMOS technology and the results were compared with the above mentioned conventional methodologies. The propagation delay for the calculation of 4-bit factorial of a number was only similar to 42.13 ns while the power consumption of the same was similar to 58.82 mW for a layout area of similar to 6 mm(2). Improvement in speed was found to be similar to 33% and similar to 24% while corresponding reduction of power consumption in similar to 34.48% and similar to 24% for the factorial calculation circuitry in comparison with UT and NND based implementations, respectively. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1343 / 1352
页数:10
相关论文
共 28 条
[1]   VHDL implementation of fast NxN multiplier based on vedic mathematic [J].
Akhter, Shamim .
2007 EUROPEAN CONFERENCE ON CIRCUIT THEORY AND DESIGN, VOLS 1-3, 2007, :472-475
[2]  
[Anonymous], 1968, Computer approximations
[3]  
[Anonymous], 2008, PROC INT SOC DESIGN, DOI DOI 10.1109/SOCDC.2008.4815685
[4]  
Avizienis A., 1961, IRE Transactions on Electronic Computers, P389
[5]  
Bi SQ, 2005, FIFTH INTERNATIONAL WORKSHOP ON SYSTEM-ON-CHIP FOR REAL-TIME APPLICATIONS, PROCEEDINGS, P396
[6]  
Booth A. D., 1952, Q J MECH APPL MATH, VIV, P236
[7]  
CARBOGNANI F, 2005, P MID W S CIRC SYST, P1406
[8]   Improved multiplier of CSD used in digital signal processing [J].
Chen, Lei ;
Tian, Xiao-Yan ;
Zhao, Xiao-Jun .
PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, :2905-2908
[9]  
Chung-Hsun Huang, 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196), P88, DOI 10.1109/ISCAS.2001.922177
[10]  
Deschamps J.P., 2006, SYNTHESIS ARITHMETIC, P180