Abstract: New VLSI circuit architectures for addition and multiplication modulo (2n - 1) and (2n + 1) are proposed that allow the implementation of highly efficient combinational and pipelined circuits for modular arithmetic. Fast multiplication is very ¬important in DSPs for convolution, Fourier transforms etc. A fast method for multiplication based on ancient Indian Vedic mathematics is proposed in this paper. Among the various methods of multiplications in Vedic mathematics, Urdhva tiryakbhyam is discussed in detail. Urdhva tiryakbhyam is a general multiplication formula applicable to all cases of multiplication. Apart from the Vedic another multiplier with parallel prefix adder architecture is well suited to realize fast end around carry adders used for modulo addition which is known as radix-8 booth multiplier is introduced .a comparative result is analyzed in the implementation.
Keywords: Radix Multiplier, Baugh-Wooley Multiplier, Carry Save array Multiplier.
[1] Y K Yamanaka, T Nishidha, T Saito, M Shimohigashi, and K Shimizu, A. Hitachi Ltd., Tokyo " A 3.8-ns CMOS 16x16-b multiplier using complementary pass-transistor logic," IEEE Journal of Solid-State Circuits, vo1.25, no 2,pp.388-95, 1990.
[2] R Zimmermann and W Fichtner, Fellow, IEEELow-Power" Logic Styles: CMOS Versus Pass-Transistor Logic," IEEE Journal Of Solid-State Circuits, vol. 32, no. 7,pp.1079- 90,1997.
[3] D Markovic, B Nikolic, and V G Oklobdzija, "A general method in synthesis of pass-transistor circuits," Microelectr. J, vol. 31,pp. 991-8,2000.
[4] C H Chang, J Gu, and M Zhang, "A review of O.J8-mm full adder performances for tree structured arithmetic circuits," IEEE Trans. Very Large Scale Integr. (VLSI) Syst. Vol. 13 pp. 686-95, 2005.
[5] Massimo Alioto, Member, IEEE, and Gaetano Palumbo, Senior Member, IEEE, "Analysis and Comparision on Full Adder Block in Submicron Technology," IEEE Transactions On Very Large Scale Integration (VLSI) Systems, vol. 10, no. 6, pp. 806-23, 2002.
[6] L Sousa and R Chaves, "A universal architecture for designing effiCient modulo 2n+ 1 multipliers, " IEEE Trans. Circuits Syst.I: Regular Papers, vol. 52, pp.1166-78, 2005. [7] T Oscal, C Chen, S Wang, and Y W Wu, "Minimization of switching activities of Partial Products for Designing LowPower Multipliers, "IEEE Transaction on Very Large Scale Integration (VLSI) Systems,vol. II, no. 3, pp. 418-433,2008. [8] A. G. Dempster and M. D. Macleod, "Constant integer multiplication using minimum adders," IEE Proc.: Circuits, Devices, Syst., vol. 141, no. 5, pp. 407-413, Oct. 1994.
[9] Y. Voronenko and M. Puschel, "Multiplierless multiple constant multiplication," ACM Transactions on Algorithms, vol. 3, iss. 2, article no. 11, May 2007.
[10] Oscar Gustafsson, "A Difference Based Adder Graph Heuristic for Multiple Constant Multiplication Problems," Int'l Symp. Circuits and Syst., New Orleans, LA, pp. 1097-1100, May 2007.