Multiplication is the key crucial operation in realizing digital signal processing (DSP) functions. It accomplished by using diverse multiplier architectures. furthermost basic and normally used action central unit (CPU). The multiplication most fundamental commonly performed activity An efficient design should have a high speed, small area, low power consumption. Compact, multipliers with mini...

This paper is devoted for the design and implementation of a 32bit Arithmetic module it is used for vedic Mathematics algorithms. We have various arithmetic multiplication techniques like Urdhva, Tiryakbhyam, Nikhilam, and Anurupye has been thoroughly analyzed. A 32 x 32 bit multiplier using Urdhava Tiryakbhyam, it has been designed and using this multiplier, a MAC unit has been designed. An Ar...

With the high demand of low power digital systems, energy dissipation in the digital system is one of the limiting factors. Reversible logic is one of the alternate to reduce heat/energy dissipation in the digital circuits and have a very significant importance in bioinformatics, optical information processing, CMOS design etc. In this paper the authors propose the design of new 2bit binary Squ...

This work is devoted for the design and FPGA implementation of a 16bit Arithmetic module, which uses Vedic Mathematics algorithms. For arithmetic multiplication various Vedic multiplication techniques like Urdhva Tiryakbhyam Nikhilam and Anurupye has been thoroughly analyzed. Also Karatsuba algorithm for multiplication has been discussed. It has been found that Urdhva Tiryakbhyam Sutra is most ...

Multiplication is a basic operation in any signal processing application. Multiplication is the most important one among the four arithmetic operations like addition, subtraction, and division. Multipliers are usually hardware intensive, and the main parameters of concern are high speed, low cost, and less VLSI area. The propagation time and power consumption in the multiplier are always high. ...

1 M.Tech student, Dept. of ECE, VLSI System Design, JNTUA, Ananthapuramu, Andhra Pradesh, India. 2Member of Technical Staff, SEER Academy, Hyderabad, India. ---------------------------------------------------------------------***--------------------------------------------------------------------Abstract Reversible logic has presented itself as a prominent technology which plays an imperative r...

let $g$ be a $p$-group of nilpotency class $k$ with finite exponent $exp(g)$ and let $m=lfloorlog_pk floor$. we show that $exp(m^{(c)}(g))$ divides $exp(g)p^{m(k-1)}$, for all $cgeq1$, where $m^{(c)}(g)$ denotes the c-nilpotent multiplier of $g$. this implies that $exp( m(g))$ divides $exp(g)$, for all finite $p$-groups of class at most $p-1$. moreover, we show that our result is an improvement...