Design of 64-Bit Squarer Based on Vedic Mathematics

"Vedic mathematics" is the ancient methodology of mathematics which has a unique technique of calculations based on 16 "sutras" (formulae). A Vedic squarer design (ASIC) using such ancient mathematics is presented in this paper. By employing the Vedic mathematics, an (N × N) bit squarer implementation was transformed into just one small squarer (bit length ≪ N) and one adder which reduces the handling of the partial products significantly, owing to high speed operation. Propagation delay and dynamic power consumption of a squarer were minimized significantly through the reduction of partial products. The functionality of these circuits was checked and performance parameters like propagation delay and dynamic power consumption were calculated by spice spectre using 90-nm CMOS technology. The propagation delay of the proposed 64-bit squarer was ~ 16 ns and consumed ~ 6.79 mW power for a layout area of ~ 5.39 mm2. By combining Boolean logic with ancient Vedic mathematics, substantial amount of partial products were eliminated that resulted in ~ 12% speed improvement (propagation delay) and ~ 22% reduction in power compared with the mostly used Vedic multiplier (Nikhilam Navatascaramam Dasatah) architecture.

[1]  M. Hasan,et al.  Design of novel quaternary encoders and decoders , 2012, 2012 International Conference on Informatics, Electronics & Vision (ICIEV).

[2]  K.-J. Cho,et al.  Parallel squarer design using pre-calculated sums of partial products , 2007 .

[3]  Chan Mo Kim,et al.  Multiplier design based on ancient Indian Vedic Mathematics , 2008, 2008 International SoC Design Conference.

[4]  Antonio G. M. Strollo,et al.  Booth folding encoding for high performance squarer circuits , 2003 .

[5]  Arindam Banerjee,et al.  ASIC design of a high speed low power circuit for factorial calculation using ancient Vedic mathematics , 2011, Microelectron. J..

[6]  Ravi Kumar Kolagotla,et al.  VLSI implementation of 350 MHz 0.35 /spl mu/m 8 bit merged squarer , 1998 .

[7]  Christopher S. Wallace,et al.  A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..

[8]  Dhanashri H. Gawali,et al.  Conventional versus Vedic Mathematical Method for Hardware Implementation of a Multiplier , 2009, 2009 International Conference on Advances in Computing, Control, and Telecommunication Technologies.

[9]  A. Dandapat,et al.  High speed ASIC design of complex multiplier using Vedic Mathematics , 2011, IEEE Technology Students' Symposium.

[10]  Aiping Hu,et al.  Design of a 32-bit squarer - exploiting addition redundancy , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

[11]  Davide De Caro,et al.  New design of squarer circuits using Booth encoding and folding techniques , 2001, ICECS 2001. 8th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.01EX483).

[12]  Jin-Gyun Chung,et al.  Efficient Squarer Design Using Group Partial Products , 2007, 2007 IEEE Workshop on Signal Processing Systems.

[13]  Chip-Hong Chang,et al.  Ultra low-voltage low-power CMOS 4-2 and 5-2 compressors for fast arithmetic circuits , 2004, IEEE Trans. Circuits Syst. I Regul. Pap..

[14]  Chris Coulston,et al.  Multiplication by complements , 2012, CONIELECOMP 2012, 22nd International Conference on Electrical Communications and Computers.

[15]  Davide De Caro,et al.  A novel truncated squarer with linear compensation function , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

[16]  M.J. Schulte,et al.  Combined unsigned and two's complement squarers , 1999, Conference Record of the Thirty-Third Asilomar Conference on Signals, Systems, and Computers (Cat. No.CH37020).

[17]  John P. Uyemura,et al.  CMOS Logic Circuit Design , 1992 .