Design And Implementation Of Efficient Multiplier Using Vedic Sutras

Theppala Devi, Perabathula Satyavani

Abstract


The primary target of this venture is to outline a productive excess parallel multiplier utilizing recursive disintegration calculation. By reasonable projection of SFG of proposed calculation and distinguishing appropriate cut-sets for bolster forward cut-set retiming, three novel high-throughput digit-serial RB multipliers are inferred to accomplish altogether less zone time-control complexities than the current ones. It is demonstrated that the proposed high-throughput structures are the best among the relating plans, for FPGA and ASIC execution. This undertaking is actualized by utilizing vedic duplications. Urdhva Tiryakbhyam sutra is utilized for planning this multiplier. Range is fundamental diminishment with this kind of multiplier. Through productive projection of flag stream chart (SFG) of the proposed calculation, a profoundly normal processor-space stream diagram (PSFG) is inferred.

References


Alessandro Cilardo, Luigi Coppolino, Nicola Mazzocca, and Luigi Romano, “Elliptic Curve Cryptography Engineering,†proc. of IEEE, vol.94, no.2, pp.395-406, Feb.2006.

N.R.Murthy and M.N.S.Swamy, “Cryptographic applications of brahmagupta-bhaskara equation,†IEEE Trans. Circuits Syst. I, Reg. Papers, vol.53, no.7, pp.1565-1571, 2006.

L.Song and K.K.Parhi, “Low-energy digit-serial/parallel finite field multipliers,†J.VLSI Digit. Process, vol.19, pp.149-166, 1998.

P.K.Meher, “On efficient implementation of accumulation in finite field over GF (2^m) and its applications,†IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol.17, no.4, pp.541-550, 2009.

L.Song, K.K.Parhi, I.Kuroda, and T.Nishitani, “Hardware / software codesign of finite field data path for low-energy Reed-Solomn codecs,†IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol.8, no.2, pp.160-172, Apr.2000.

G.Drolet, “A new representation of elements of finite fields GF (2^m) yielding small complexity arithmetic circuits,†IEEE Trans. Comput., vol.47, no.9, pp.938-946, 1998.

C.Y.Lee, J.S.Horng, I.C.Jou, and E.H.Lu, “Low-complexity bit parallel systolic Montgomery multipliers for special classes of GF (2^m),†IEEE Trans. Comput., vol.54, no.9, pp.1061-1070, Sep.2005.

P.K.Meher, “Systolic and super-systolic multipliers for finite field GF (2^m) based on irreducible trinomials,†IEEE Trans. Circuits Syst. I, Reg. Papers, vol.55, no.4, pp.1031-1040, May 2008.


Full Text: PDF [Full Text]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.

Â