##plugins.themes.academic_pro.article.main##
Abstract
In VLSI technology speed optimization plays a vital role. So designing of high speed devices became necessary to fulfill the end user requirements. Generally the processor designing is mainly depending upon the MAC units. In that particularly multiplier architecture comes under crucial design. Vedic Mathematics is the ancient methodology of Indian mathematics which has a unique technique of calculations based on 16 Sutras (Formulae). In this paper the importance of Urdhva tiryakbhyam Sutra and Nikhilam Sutra are discussed. The design of complex multiplier designed using this sutra consists of Radix Selection Unit (RSU), Exponent Determinant (ED), Mean Determinant (MD) and Comparator. The multiplier shows the product of the provided inputs with reduced latency along with optimized power estimation. Transistor level implementation of Vedic Mathematics based 16-bit complex multiplier for high speed low power processor is reported in this paper. The functionality of these circuits was checked and performance parameters like propagation delay and dynamic power consumption were calculated by Xilinx sparten3E using standard 90nm CMOS technology for synthesis and simulation. The propagation delay of the resulting (16, 16) x (16, 16) complex multiplier was found to be 4ns and consume 81mW power. The implementation offered significant improvement in terms of delay and power from earlier reported ones.
Keywords—Vedic Mathematics, Nikilam sutra, partial product, Exponent & Mean determinant, Xilinx.##plugins.themes.academic_pro.article.details##
References
2. Chandrakasan and R. Brodersen, “Low-power CMOS digital design†, IEEE Journals on Solid-State Circuits, Vol. 27, No. 4, pp. 473–484, Apr. 1992.
3. N.-Y. Shen and O. T.-C. Chen, “Low-power multipliers by minimizing switching activities of partial productsâ€, Proc. IEEE, ISCAS 2002, vol. 4, pp. 93–96, May 2002.
4. O. T. Chen, S. Wang, and Y.-W. Wu, “Minimization of switching activities of partial products for designing low-power multipliers,†IEEE Transc. on Very Large Scale Integration (VLSI) Syst., Vol. 11, No. 3, pp. 418–433, June 2003.
5. Parhami, Computer Arithmetic Algorithms and Hardware Designs, 1st ed. Oxford, U.K.: Oxford Univ. Press, 2000.
6. S Wallace, “A Suggestion for a Fast Multiplier,†IEEE Trans. on Computers, Vol. EC13, pp. 14-17, December 1964.
7. J. Hu, L. Wang, and T. Xu, “A Low-Power Adiabatic Multiplier Based on Modified Booth Algorithmâ€, Proc. IEEE, ISIC’07, pp. 489-492, Sept. 26-28, 2007.
8. R. Baugh, and B.A. Wooley, “A Two's Complement Parallel Array Multiplication Algorithmâ€, IEEE transc. on Computers, Vol. C-22, No. 12, pp. 1045-1047, December 1973
9. K-C. Kuo, and C-W. Chou, “Low power and high speed multiplier design with row bypassing and parallel architecture, Journal of Microelectronics, 2010, doi:10.1016/j.mejo.2010.06.009
10. P. K. Saha, A. Banerjee, and A. Dandapat, "High Speed Low Power Complex Multiplier Design Using Parallel Adders and Subtractors," International Journal on Electronic and Electrical Engineering, (/EEE), vol 07, no. II, pp 38-46, Dec. 2009.
11. R. E. Blahut, Fast Algorithms for Digital Signal Processing, Reading, MA: Addison-Wesley, 1987.
12. S. He, and M. Torkelson, "A pipelined bit-serial complex multiplier using distributed arithmetic," in proceedings IEEE International Symposium on Circuits and Systems, Seattle, WA, April 30-May-03, 1995,pp. 2313-2316.
13. J. E. VoIder, "The CORDIC trigonometric computing technique," IRE Trans. Electron. Comput, vol. EC-8, pp. 330-334, Sept. 1959.
14. R. Krishnan, G. A. Jullien, and W. C. Miller, "Complex digital“ Spartan-3E FPGA Starter Kit Board User Guideâ€, UG230 (v1.1) June 20, 2008.
15. Jagadguru Swami Sri Bharati Krsna Tirthaji Maharaja, “Vedic mathematicsâ€, Motilal Banarsidass Publishers Pvt Ltd, Delhi