Duplicate and Accumulate (MAC) is one of the central practices utilized absolutely in signal-controlling
and different applications. The multiplier is the major piece of Digital Signal Processors (DSPs). Its cutoff spins around power, LUT use, and surrender pick the presence of a DSP. In like way, there is a need to sort out the drive and give up fit multiplier. In this paper, a 16-digit MAC unit is proposed to utilize an 8-cycle Vedic multiplier and pass on a save snake. A relationship with the current 8-cycle Vedic multiplier utilizing Square-Root (SQR) Carryselect snake (CSLA) is introduced. It is isolated and a standard pack multiplier. The whole technique is done in Verilog HDL. Blend and redirections were finished utilizing Xilinx InDesign Suite 14.5. The proposed game plan
accomplishes fundamental improvement in region and suspension. In like manner, an abatement in power around 9.5% is refined.
Implementation of area optimized low power multiplication and accumulationkarthik annam
This document discusses the design of an area-optimized low power multiply-accumulate (MAC) unit for digital signal processing applications. It begins with an introduction to MAC units and their importance in DSP. It then discusses existing MAC unit implementations and their drawbacks related to area, power and speed. The document proposes a multiplier-less MAC unit design using shifting operations instead of multiplication to improve efficiency. It describes developing C code to generate the MAC equations and implementing the multiplier-less MAC units in Verilog. Simulation and synthesis results are presented showing the resource utilization of the proposed design is lower than traditional multiplier-based MAC units. Potential applications and future work to further optimize area, speed and power consumption are discussed.
Design and Implementation of Low Power DSP Core with Programmable Truncated V...ijsrd.com
The programmable truncated Vedic multiplication is the method which uses Vedic multiplier and programmable truncation control bits and which reduces part of the area and power required by multipliers by only computing the most-significant bits of the product. The basic process of truncation includes physical reduction of the partial product matrix and a compensation for the reduced bits via different hardware compensation sub circuits. These results in fixed systems optimized for a given application at design time. A novel approach to truncation is proposed, where a full precision vedic multiplier is implemented, but the active section of the truncation is selected by truncation control bits dynamically at run-time. Such architecture brings together the power reduction benefits from truncated multipliers and the flexibility of reconfigurable and general purpose devices. Efficient implementation of such a multiplier is presented in a custom digital signal processor where the concept of software compensation is introduced and analyzed for different applications. Experimental results and power measurements are studied, including power measurements from both post-synthesis simulations and a fabricated IC implementation. This is the first system-level DSP core using a high speed Vedic truncated multiplier. Results demonstrate the effectiveness of the programmable truncated MAC (PTMAC) in achieving power reduction, with minimum impact on functionality for a number of applications. On comparison with the previous parallel multipliers Vedic should be much more fast and area should be reduced. Programmable truncated Vedic multiplier (PTVM) should be the basic part implemented for the arithmetic and PTMAC units.
In present day MAC unit is demanded in most of the Digital signal processing. Function of addition and multiplication is performed by the MAC unit. MAC operates in two stages. Firstly, multiplier computes the given number output and the result is forwarded to second stage i.e. addition/accumulation operates. Speed of multiplier is important in MAC unit which determines critical path as well as area is also of great importance in designing of MAC unit. Multiplier plays an important roles in many digital signal processing (DSP) applications such as in convolution, digital filters and other data processing unit. Many research has been performed on MAC implementation. This paper provides analysis of the research and investigations held till now.
Fpga based efficient multiplier for image processing applications using recur...VLSICS Design
The Digital Image processing applications like medical imaging, satellite imaging, Biometric trait images
etc., rely on multipliers to improve the quality of image. However, existing multiplication techniques
introduce errors in the output with consumption of more time, hence error free high speed multipliers has
to be designed. In this paper we propose FPGA based Recursive Error Free Mitchell Log Multiplier
(REFMLM) for image Filters. The 2x2 error free Mitchell log multiplier is designed with zero error by
introducing error correction term is used in higher order Karastuba-Ofman Multiplier (KOM)
Architectures. The higher order KOM multipliers is decomposed into number of lower order multipliers
using radix 2 till basic multiplier block of order 2x2 which is designed by error free Mitchell log multiplier.
The 8x8 REFMLM is tested for Gaussian filter to remove noise in fingerprint image. The Multiplier is
synthesized using Spartan 3 FPGA family device XC3S1500-5fg320. It is observed that the performance
parameters such as area utilization, speed, error and PSNR are better in the case of proposed architecture
compared to existing architectures.
Review On Design Of Low Power Multiply And Accumulate Unit Using Baugh-Wooley...IRJET Journal
This document reviews designs for low power multiply and accumulate (MAC) units. It summarizes several papers on MAC unit architectures that aim to improve speed and reduce power consumption. For 8-bit MAC units, designs using a Baugh-Wooley multiplier have increased delay but very low power compared to other techniques. For 16-bit MAC units, a proposed 2-cycle MAC architecture has less power and delay than other 2-cycle and 3-cycle MAC units. For 32-bit MAC units, designs using a Baugh-Wooley multiplier with a high performance multiplier tree exhibit comparable delay, less power dissipation, and smaller area than designs using a modified Booth multiplier. In general, incorporating a Baugh-Wooley multiplier
A Time-Area-Power Efficient High Speed Vedic Mathematics Multiplier using Com...Kumar Goud
Abstract: With the advent of new technology in the fields of VLSI and communication, there is also an ever growing demand for high speed processing and low area design. It is also a well known fact that the multiplier unit forms an integral part of processor design. Due to this regard, high speed multiplier architectures become the need of the day. In this paper, we introduce a novel architecture to perform high speed multiplication using ancient Vedic maths techniques. A new high speed approach utilizing 4:2 compressors and novel 7:2 compressors for addition has also been incorporated in the same and has been explored. Upon comparison, the compressor based multiplier introduced in this paper, is almost two times faster than the popular methods of multiplication. With regards to area, a 1% reduction is seen. The design and experiments were carried out on a Xilinx Spartan 3e series of FPGA and the timing and area of the design, on the same have been calculated.
Keywords—4:2 Compressor, 7:2 Compressor, Booth’s multiplier, high speed multiplier, modified Booth’s multiplier, Urdhwa Tiryakbhyam Sutra, Vedic Mathematics.
A Review - Synchronization Approaches to Digital systemsIJERA Editor
Synchronization is a prime requirement in the process of Digital systems. Wherein new devices are upcoming
towards providing higher service level, advanced distributed systems are been integrated onto a single platform
for higher service provision. However with the integration of large processing units, the distributed processing
needs a high level synchronization with minimum processing overhead. The issue of synchronization was
processed by various approaches. This paper outlines a brief review on the developments made in the field of
synchronization approach to digital system, under distributed mode operation.
A Review of Different Methods for Booth MultiplierIJERA Editor
In this review paper, different type of implementation of Booth multiplier has been studied. Multipliers has great importance in digital signal processor, so designing a high-speed multiplier is the need of the hour. Advantages of using modified booth multiplier algorithm is that the number of partial product is reduced. Different types of addition algorithms are also discussed which are used for addition operation of multiplier.
Implementation of area optimized low power multiplication and accumulationkarthik annam
This document discusses the design of an area-optimized low power multiply-accumulate (MAC) unit for digital signal processing applications. It begins with an introduction to MAC units and their importance in DSP. It then discusses existing MAC unit implementations and their drawbacks related to area, power and speed. The document proposes a multiplier-less MAC unit design using shifting operations instead of multiplication to improve efficiency. It describes developing C code to generate the MAC equations and implementing the multiplier-less MAC units in Verilog. Simulation and synthesis results are presented showing the resource utilization of the proposed design is lower than traditional multiplier-based MAC units. Potential applications and future work to further optimize area, speed and power consumption are discussed.
Design and Implementation of Low Power DSP Core with Programmable Truncated V...ijsrd.com
The programmable truncated Vedic multiplication is the method which uses Vedic multiplier and programmable truncation control bits and which reduces part of the area and power required by multipliers by only computing the most-significant bits of the product. The basic process of truncation includes physical reduction of the partial product matrix and a compensation for the reduced bits via different hardware compensation sub circuits. These results in fixed systems optimized for a given application at design time. A novel approach to truncation is proposed, where a full precision vedic multiplier is implemented, but the active section of the truncation is selected by truncation control bits dynamically at run-time. Such architecture brings together the power reduction benefits from truncated multipliers and the flexibility of reconfigurable and general purpose devices. Efficient implementation of such a multiplier is presented in a custom digital signal processor where the concept of software compensation is introduced and analyzed for different applications. Experimental results and power measurements are studied, including power measurements from both post-synthesis simulations and a fabricated IC implementation. This is the first system-level DSP core using a high speed Vedic truncated multiplier. Results demonstrate the effectiveness of the programmable truncated MAC (PTMAC) in achieving power reduction, with minimum impact on functionality for a number of applications. On comparison with the previous parallel multipliers Vedic should be much more fast and area should be reduced. Programmable truncated Vedic multiplier (PTVM) should be the basic part implemented for the arithmetic and PTMAC units.
In present day MAC unit is demanded in most of the Digital signal processing. Function of addition and multiplication is performed by the MAC unit. MAC operates in two stages. Firstly, multiplier computes the given number output and the result is forwarded to second stage i.e. addition/accumulation operates. Speed of multiplier is important in MAC unit which determines critical path as well as area is also of great importance in designing of MAC unit. Multiplier plays an important roles in many digital signal processing (DSP) applications such as in convolution, digital filters and other data processing unit. Many research has been performed on MAC implementation. This paper provides analysis of the research and investigations held till now.
Fpga based efficient multiplier for image processing applications using recur...VLSICS Design
The Digital Image processing applications like medical imaging, satellite imaging, Biometric trait images
etc., rely on multipliers to improve the quality of image. However, existing multiplication techniques
introduce errors in the output with consumption of more time, hence error free high speed multipliers has
to be designed. In this paper we propose FPGA based Recursive Error Free Mitchell Log Multiplier
(REFMLM) for image Filters. The 2x2 error free Mitchell log multiplier is designed with zero error by
introducing error correction term is used in higher order Karastuba-Ofman Multiplier (KOM)
Architectures. The higher order KOM multipliers is decomposed into number of lower order multipliers
using radix 2 till basic multiplier block of order 2x2 which is designed by error free Mitchell log multiplier.
The 8x8 REFMLM is tested for Gaussian filter to remove noise in fingerprint image. The Multiplier is
synthesized using Spartan 3 FPGA family device XC3S1500-5fg320. It is observed that the performance
parameters such as area utilization, speed, error and PSNR are better in the case of proposed architecture
compared to existing architectures.
Review On Design Of Low Power Multiply And Accumulate Unit Using Baugh-Wooley...IRJET Journal
This document reviews designs for low power multiply and accumulate (MAC) units. It summarizes several papers on MAC unit architectures that aim to improve speed and reduce power consumption. For 8-bit MAC units, designs using a Baugh-Wooley multiplier have increased delay but very low power compared to other techniques. For 16-bit MAC units, a proposed 2-cycle MAC architecture has less power and delay than other 2-cycle and 3-cycle MAC units. For 32-bit MAC units, designs using a Baugh-Wooley multiplier with a high performance multiplier tree exhibit comparable delay, less power dissipation, and smaller area than designs using a modified Booth multiplier. In general, incorporating a Baugh-Wooley multiplier
A Time-Area-Power Efficient High Speed Vedic Mathematics Multiplier using Com...Kumar Goud
Abstract: With the advent of new technology in the fields of VLSI and communication, there is also an ever growing demand for high speed processing and low area design. It is also a well known fact that the multiplier unit forms an integral part of processor design. Due to this regard, high speed multiplier architectures become the need of the day. In this paper, we introduce a novel architecture to perform high speed multiplication using ancient Vedic maths techniques. A new high speed approach utilizing 4:2 compressors and novel 7:2 compressors for addition has also been incorporated in the same and has been explored. Upon comparison, the compressor based multiplier introduced in this paper, is almost two times faster than the popular methods of multiplication. With regards to area, a 1% reduction is seen. The design and experiments were carried out on a Xilinx Spartan 3e series of FPGA and the timing and area of the design, on the same have been calculated.
Keywords—4:2 Compressor, 7:2 Compressor, Booth’s multiplier, high speed multiplier, modified Booth’s multiplier, Urdhwa Tiryakbhyam Sutra, Vedic Mathematics.
A Review - Synchronization Approaches to Digital systemsIJERA Editor
Synchronization is a prime requirement in the process of Digital systems. Wherein new devices are upcoming
towards providing higher service level, advanced distributed systems are been integrated onto a single platform
for higher service provision. However with the integration of large processing units, the distributed processing
needs a high level synchronization with minimum processing overhead. The issue of synchronization was
processed by various approaches. This paper outlines a brief review on the developments made in the field of
synchronization approach to digital system, under distributed mode operation.
A Review of Different Methods for Booth MultiplierIJERA Editor
In this review paper, different type of implementation of Booth multiplier has been studied. Multipliers has great importance in digital signal processor, so designing a high-speed multiplier is the need of the hour. Advantages of using modified booth multiplier algorithm is that the number of partial product is reduced. Different types of addition algorithms are also discussed which are used for addition operation of multiplier.
Parallel Processing Technique for Time Efficient Matrix MultiplicationIJERA Editor
The document proposes a parallel-parallel input single output (PPI-SO) design for matrix multiplication that reduces hardware resources compared to existing designs. It uses fewer multipliers and registers than existing designs, trading off increased completion time. Simulation results show the PPI-SO design uses 30% less energy and involves 70% less area-delay product than other designs.
Implementation of High Speed & Area Efficient Modified Booth Recoder for Effi...IJMTST Journal
Many communication applications require multifaceted arithmetic operation are used in many digital
signal processing (DSP) relevance. Mainly in the reduction of multiplier power and area consumption it can
play an important role in high performance of any digital indication processing system. within this paper,
mainly centre of attention on optimizing and increased performance by reduction in power consumption in
propose of the fused Add-Multiply (FAM) operator. This implements a new technique by straight recoding of
sum two numbers in Modified Booth (MB) form. In this paper implemented a new and efficient structured
technique by straight recoding of sum of two numbers by considering existing modified booth (MB)
technique. The new technique is implemented by three new dissimilar schemes by integrating them within
existing FAM plans. The performance of the proposed three different schemes with the implementation of
new model carry select adder (K-adders) gives reduction in conditions of critical delay, hardware
complication and power utilization while comparing with the existing AM design.
The proposed system is an efficient processing of 16-bit Multiplier Accumulator using Radix-8 and Radix-16 modified Booth Algorithm and other adders (SPST adder, Carry select adder, Parallel Prefix adder) using VHDL (Very High Speed Integrated Circuit Hardware Description Language). This proposed system provides low power, high speed and fewer delays. In both booth multipliers, comparison between the power consumption (mw) and estimated delay (ns) are calculated. The application of digital signal processing like fast fourier transform, finite impulse response and convolution needs high speed and low power MAC (Multiplier and Accumulator) units to construct an added. By reducing the glitches (from 1 to 0 transition) and spikes (from 0 to 1 transition), the speed of operation is improved and dynamic power is reduced. The adder designed with SPST avoids the unwanted glitches and spikes, reduce the switching power dissipation and the dynamic power. The speed can be improved by reducing the number of partial products to half, by grouping of bits in the multiplier term. The proposed Radix-8 and Radix-16 Modified Booth Algorithm MAC with SPST reduces the delay and obtain low power consumption as compared to array MAC.
IRJET- Flexible DSP Accelerator Architecture using Carry Lookahead TreeIRJET Journal
This document presents a flexible DSP accelerator architecture using a carry lookahead tree. It aims to improve on existing flexible accelerator designs by enabling computations to be efficiently performed using carry lookahead formatted data. The proposed architecture contains flexible computational units that can efficiently execute a wide range of DSP operation patterns. It differs from prior work by using a carry lookahead tree instead of a carry save tree. Simulation results show the proposed design achieves faster execution and a larger reduction in delay time compared to existing flexible accelerator approaches.
Design and Implementation of an Efficient 64 bit MACIJERA Editor
The design of optimized 64 bit multiplier and accumulator (MAC) unit is implemented in this paper. MAC unit plays major role in many of the digital signal processing (DSP) applications. The MAC unit is designed with the combinations of multipliers and adders. In the proposed method MAC unit is implemented using Vedic multiplier and the adder is done with ripple carry adder .The components are reduced by implementing Vedic multiplier using the techniques of Vedic mathematics that have been modified to improve performance. a high speed processor depends significantly on the multiplier as it is one of the key hardware blocks in most digital signal processing systems as well as in general processors. The area is optimized effectively using Vedic multiplier .The total design implemented using Xilinx.
PERFORMANCE EVALUATION OF LOW POWER CARRY SAVE ADDER FOR VLSI APPLICATIONSVLSICS Design
This document discusses the performance evaluation of a low power carry save adder (CSA) for VLSI applications. It begins with an abstract that examines subthreshold leakage in CSA circuits and how reducing threshold voltage can lower power consumption. The document then reviews previous work on CSA design. It presents the architecture of a proposed 4-bit CSA designed using gate diffusion input cells to reduce area and power. Simulation results show the CSA has total average power of 4.93μW, propagation delay of 16.3ns, and 37% reduced area due to using GDI cells. The CSA operates as intended in subthreshold regions with low static leakage current.
PERFORMANCE EVALUATION OF LOW POWER CARRY SAVE ADDER FOR VLSI APPLICATIONSVLSICS Design
This report examines the subject of sub threshold leakage on carry save adder. When the gate to source voltage reduces to the threshold voltage at that place is yet some amount of current flow in the circuit and that is undesired. As the process technology advancing much rapidly the threshold voltage of MOS devices reduces very drastically, and it must be applied in lower power devices since it contributes to low amount of leakage current which confine increases the power consumption of the devices. Adders are the basic building blocks for any digital circuit design and used in almost all arithmetic’s. The CSA proves efficient adders due to its quick and precise computations. Hence this paper performs sub threshold analysis on CSA and the scrutinize results that the total average power is around 4.93µW, the propagation delay for complete operation is 16.3ns and since this design uses GDI cell so there is a reduction in area with 37%.
PERFORMANCE EVALUATION OF LOW POWER CARRY SAVE ADDER FOR VLSI APPLICATIONSVLSICS Design
This report examines the subject of sub threshold leakage on carry save adder. When the gate to source voltage reduces to the threshold voltage at that place is yet some amount of current flow in the circuit and that is undesired. As the process technology advancing much rapidly the threshold voltage of MOS devices reduces very drastically, and it must be applied in lower power devices since it contributes to low amount
of leakage current which confine increases the power consumption of the devices. Adders are the basic
building blocks for any digital circuit design and used in almost all arithmetic’s. The CSA proves efficient adders due to its quick and precise computations. Hence this paper performs sub threshold analysis on CSA and the scrutinize results that the total average power is around 4.93µW, the propagation delay for complete operation is 16.3ns and since this design uses GDI cell so there is a reduction in area with 37%.
High-Speed and Energy-Efficient MAC Design using Vedic Multiplier and Carry S...IRJET Journal
The document describes a proposed design for a high-speed and energy-efficient multiply-accumulate (MAC) unit using a Vedic multiplier and various carry-skip adders. It first examines the area and delays of three types of carry-skip adder designs. It then describes the design of a 16x16-bit Vedic multiplier based on the Urdhva-Tiryagbhyam multiplication algorithm. Finally, it presents the proposed MAC unit architecture which integrates the Vedic multiplier with the different carry-skip adder designs to achieve improved speed and energy efficiency compared to existing MAC units. The goal is to reduce multiplication delay and improve performance for applications like digital signal processing.
This document describes a research paper on designing a high-speed application-specific integrated circuit (ASIC) for complex number multiplication using concepts from Vedic mathematics. The paper aims to improve multiplication speed by eliminating carry propagation delays. It proposes a design that uses Vedic sutras to transform complex number multiplication into four real number multiplications and three additions. The design is implemented in VHDL or Verilog and synthesized using Xilinx tools. Simulation results show improvements in propagation delay, power consumption, and area compared to other complex multiplier designs.
The use of reversible logic gates in the design of residue number systems IJECEIAES
Reversible computing is an emerging technique to achieve ultra-low-power circuits. Reversible arithmetic circuits allow for achieving energy-efficient high-performance computational systems. Residue number systems (RNS) provide parallel and fault-tolerant additions and multiplications without carry propagation between residue digits. The parallelism and fault-tolerance features of RNS can be leveraged to achieve high-performance reversible computing. This paper proposed RNS full reversible circuits, including forward converters, modular adders and multipliers, and reverse converters used for a class of RNS moduli sets with the composite form {2 k p , 2 -1}. Modulo 2 n -1, 2 n , and 2 n +1 adders and multipliers were designed using reversible gates. Besides, reversible forward and reverse converters for the 3-moduli set {2 n -1, 2 n+k n , 2 +1} have been designed. The proposed RNS- based reversible computing approach has been applied for consecutive multiplications with an improvement of above 15% in quantum cost after the twelfth iteration, and above 27% in quantum depth after the ninth iteration. The findings show that the use of the proposed RNS-based reversible computing in convolution results in a significant improvement in quantum depth in comparison to conventional methods based on weighted binary adders and multipliers.
A MULTI-OBJECTIVE PERSPECTIVE FOR OPERATOR SCHEDULING USING FINEGRAINED DVS A...VLSICS Design
The stringent power budget of fine grained power managed digital integrated circuits have driven chip designers to optimize power at the cost of area and delay, which were the traditional cost criteria for circuit optimization. The emerging scenario motivates us to revisit the classical operator scheduling problem under the availability of DVFS enabled functional units that can trade-off cycles with power. We study the design space defined due to this trade-off and present a branch-and-bound(B/B) algorithm to explore this state space and report the pareto-optimal front with respect to area and power. The scheduling also aims at maximum resource sharing and is able to attain sufficient area and power gains for complex benchmarks when timing constraints are relaxed by sufficient amount. Experimental results show that the algorithm that operates without any user constraint(area/power) is able to solve the problem for mostavailable benchmarks, and the use of power budget or area budget constraints leads to significant performance gain.
Analysis of different multiplication algorithm and FPGA implementation of rec...IRJET Journal
The document describes a new recursive barrel shifter algorithm for multiplication and its FPGA implementation. It analyzes existing multiplication algorithms like Booth, Wallace tree, Karatsuba and their limitations. The proposed algorithm uses a barrel shifter recursively by counting the number of ones in each number, shifting the multiplicand by powers of two, and adding the results. This is implemented on a Xilinx FPGA for performance analysis in terms of speed, power and area.
Multipliers play an important role in today’s digital signal processing (DSP) and various other
applications. Multiplication is the most time consuming process in various signal processing operations like
convolution, circular convolution, auto-correlation and cross-correlation. With advances in technology, many
researchers have tried and are trying to design multipliers which offer either of the following- high speed, low
power consumption, regularity of layout and hence less area or even combination of them in multiplier. However
area and speed are two conflicting constraints. So improving speed results always in larger areas. So here we try
to find out the best trade off solution among the both of them. To have features like high speed and low power
consumption multipliers several algorithms have been introduced .In this paper, we describes Multipliers by using
various algorithm in VLSI technology.
Design of Efficient High Speed Vedic Multiplierijsrd.com
Multipliers are extensively used in Microprocessors, DSP and Communication applications. For higher order multiplications, a huge number of adders are to be used to perform the partial product addition. This paper proposed the design of high speed Vedic Multiplier using the techniques of Ancient Indian Vedic Mathematics that have been modified to improve performance. Vedic Mathematics is the ancient system of mathematics which has a unique technique of calculations based on 16 Sutras. The work has proved the efficiency of Urdhva Triyagbhyam. It enables parallel generation of intermediate products, eliminates unwanted multiplication steps. Urdhva tiryakbhyam Sutra is most efficient Sutra (Algorithm), giving minimum delay for multiplication of all types of numbers, either small or large.
In this project 31 % area delay product reduction is possible with the use of the CSLA based 32 bit unsigned parallel multiplier than CLAA based 32 bit unsigned parallel multiplier
This document discusses the design of a pipelined architecture for sparse matrix-vector multiplication on an FPGA. It begins with introductions to matrices, linear algebra, and matrix multiplication. It then describes the objective of building a hardware processor to perform multiple arithmetic operations in parallel through pipelining. The document reviews literature on pipelined floating point units. It provides details on the proposed pipelined design for sparse matrix-vector multiplication, including storing vector values in on-chip memory and using multiple pipelines to complete results in parallel. Simulation results showing reduced power and execution time are presented before concluding the design can improve performance for scientific applications.
IMPLEMENTATION OF UNSIGNED MULTIPLIER USING MODIFIED CSLAeeiej_journal
This document discusses the implementation of an unsigned multiplier using a modified carry select adder technique. It begins with an introduction to digital arithmetic operations like multiplication and addition. It then describes the proposed system, which uses a modified carry select adder based multiplier to reduce area over a traditional carry look ahead adder based multiplier, while maintaining similar delay times. The document provides details on the design of regular and modified square root carry select adders used in the multiplier. It discusses how replacing ripple carry adders with binary to excess-1 converters in the modified design can further reduce area and power consumption.
Design and testing of systolic array multiplier using fault injecting schemesCSITiaesprime
Nowadays low power design circuits are major important for data transmission and processing the information among various system designs. One of the major multipliers used for synchronizing the data transmission is the systolic array multiplier, low power designs are mostly used for increasing the performance and reducing the hardware complexity. Among all the mathematical operations, multiplier plays a major role where it processes more information and with the high complexity of circuit in the existing irreversible design. We develop a systolic array multiplier using reversible gates for low power appliances, faults and coverage of the reversible logic are calculated in this paper. To improvise more, we introduced a reversible logic gate and tested the reversible systolic array multiplier using the fault injection method of built-in self-test block observer (BILBO) in which all corner cases are covered which shows 97% coverage compared with existing designs. Finally, Xilinx ISE 14.7 was used for synthesis and simulation results and compared parameters with existing designs which prove more efficiency.
Adiabatic technique based low power synchronous counter designIJECEIAES
The performance of integrated circuits is evaluated by their design architecture, which ensures high reliability and optimizes energy. The majority of the system-level architectures consist of sequential circuits. Counters are fundamental blocks in numerous very large-scale integration (VLSI) applications. The T-flip-flop is an important block in synchronous counters, and its high-power consumption impacts the overall effectiveness of the system. This paper calculates the power dissipation (PD), power delay product (PDP), and latency of the presented T flip-flop. To create a 2-bit synchronous counter based on the novel T flip-flops, a performance matrix such as PD, latency, and PDP is analyzed. The analysis is carried out at 100 and 10 MHz frequencies with varying temperatures and operating voltages. It is observed that the presented counter design has a lesser power requirement and PDP compared to the existing counter architectures. The proposed T-flip-flop design at the 45 nm technology node shows an improvement of 30%, 76%, and 85% in latency, PD, and PDP respectively to the 180 nm node at 10 MHz frequency. Similarly, the proposed counter at the 45 nm technology node shows 96% and 97% improvement in power dissipation, delay, and PDP respectively compared to the 180 nm at 10 MHz frequency.
Parallel Processing Technique for Time Efficient Matrix MultiplicationIJERA Editor
The document proposes a parallel-parallel input single output (PPI-SO) design for matrix multiplication that reduces hardware resources compared to existing designs. It uses fewer multipliers and registers than existing designs, trading off increased completion time. Simulation results show the PPI-SO design uses 30% less energy and involves 70% less area-delay product than other designs.
Implementation of High Speed & Area Efficient Modified Booth Recoder for Effi...IJMTST Journal
Many communication applications require multifaceted arithmetic operation are used in many digital
signal processing (DSP) relevance. Mainly in the reduction of multiplier power and area consumption it can
play an important role in high performance of any digital indication processing system. within this paper,
mainly centre of attention on optimizing and increased performance by reduction in power consumption in
propose of the fused Add-Multiply (FAM) operator. This implements a new technique by straight recoding of
sum two numbers in Modified Booth (MB) form. In this paper implemented a new and efficient structured
technique by straight recoding of sum of two numbers by considering existing modified booth (MB)
technique. The new technique is implemented by three new dissimilar schemes by integrating them within
existing FAM plans. The performance of the proposed three different schemes with the implementation of
new model carry select adder (K-adders) gives reduction in conditions of critical delay, hardware
complication and power utilization while comparing with the existing AM design.
The proposed system is an efficient processing of 16-bit Multiplier Accumulator using Radix-8 and Radix-16 modified Booth Algorithm and other adders (SPST adder, Carry select adder, Parallel Prefix adder) using VHDL (Very High Speed Integrated Circuit Hardware Description Language). This proposed system provides low power, high speed and fewer delays. In both booth multipliers, comparison between the power consumption (mw) and estimated delay (ns) are calculated. The application of digital signal processing like fast fourier transform, finite impulse response and convolution needs high speed and low power MAC (Multiplier and Accumulator) units to construct an added. By reducing the glitches (from 1 to 0 transition) and spikes (from 0 to 1 transition), the speed of operation is improved and dynamic power is reduced. The adder designed with SPST avoids the unwanted glitches and spikes, reduce the switching power dissipation and the dynamic power. The speed can be improved by reducing the number of partial products to half, by grouping of bits in the multiplier term. The proposed Radix-8 and Radix-16 Modified Booth Algorithm MAC with SPST reduces the delay and obtain low power consumption as compared to array MAC.
IRJET- Flexible DSP Accelerator Architecture using Carry Lookahead TreeIRJET Journal
This document presents a flexible DSP accelerator architecture using a carry lookahead tree. It aims to improve on existing flexible accelerator designs by enabling computations to be efficiently performed using carry lookahead formatted data. The proposed architecture contains flexible computational units that can efficiently execute a wide range of DSP operation patterns. It differs from prior work by using a carry lookahead tree instead of a carry save tree. Simulation results show the proposed design achieves faster execution and a larger reduction in delay time compared to existing flexible accelerator approaches.
Design and Implementation of an Efficient 64 bit MACIJERA Editor
The design of optimized 64 bit multiplier and accumulator (MAC) unit is implemented in this paper. MAC unit plays major role in many of the digital signal processing (DSP) applications. The MAC unit is designed with the combinations of multipliers and adders. In the proposed method MAC unit is implemented using Vedic multiplier and the adder is done with ripple carry adder .The components are reduced by implementing Vedic multiplier using the techniques of Vedic mathematics that have been modified to improve performance. a high speed processor depends significantly on the multiplier as it is one of the key hardware blocks in most digital signal processing systems as well as in general processors. The area is optimized effectively using Vedic multiplier .The total design implemented using Xilinx.
PERFORMANCE EVALUATION OF LOW POWER CARRY SAVE ADDER FOR VLSI APPLICATIONSVLSICS Design
This document discusses the performance evaluation of a low power carry save adder (CSA) for VLSI applications. It begins with an abstract that examines subthreshold leakage in CSA circuits and how reducing threshold voltage can lower power consumption. The document then reviews previous work on CSA design. It presents the architecture of a proposed 4-bit CSA designed using gate diffusion input cells to reduce area and power. Simulation results show the CSA has total average power of 4.93μW, propagation delay of 16.3ns, and 37% reduced area due to using GDI cells. The CSA operates as intended in subthreshold regions with low static leakage current.
PERFORMANCE EVALUATION OF LOW POWER CARRY SAVE ADDER FOR VLSI APPLICATIONSVLSICS Design
This report examines the subject of sub threshold leakage on carry save adder. When the gate to source voltage reduces to the threshold voltage at that place is yet some amount of current flow in the circuit and that is undesired. As the process technology advancing much rapidly the threshold voltage of MOS devices reduces very drastically, and it must be applied in lower power devices since it contributes to low amount of leakage current which confine increases the power consumption of the devices. Adders are the basic building blocks for any digital circuit design and used in almost all arithmetic’s. The CSA proves efficient adders due to its quick and precise computations. Hence this paper performs sub threshold analysis on CSA and the scrutinize results that the total average power is around 4.93µW, the propagation delay for complete operation is 16.3ns and since this design uses GDI cell so there is a reduction in area with 37%.
PERFORMANCE EVALUATION OF LOW POWER CARRY SAVE ADDER FOR VLSI APPLICATIONSVLSICS Design
This report examines the subject of sub threshold leakage on carry save adder. When the gate to source voltage reduces to the threshold voltage at that place is yet some amount of current flow in the circuit and that is undesired. As the process technology advancing much rapidly the threshold voltage of MOS devices reduces very drastically, and it must be applied in lower power devices since it contributes to low amount
of leakage current which confine increases the power consumption of the devices. Adders are the basic
building blocks for any digital circuit design and used in almost all arithmetic’s. The CSA proves efficient adders due to its quick and precise computations. Hence this paper performs sub threshold analysis on CSA and the scrutinize results that the total average power is around 4.93µW, the propagation delay for complete operation is 16.3ns and since this design uses GDI cell so there is a reduction in area with 37%.
High-Speed and Energy-Efficient MAC Design using Vedic Multiplier and Carry S...IRJET Journal
The document describes a proposed design for a high-speed and energy-efficient multiply-accumulate (MAC) unit using a Vedic multiplier and various carry-skip adders. It first examines the area and delays of three types of carry-skip adder designs. It then describes the design of a 16x16-bit Vedic multiplier based on the Urdhva-Tiryagbhyam multiplication algorithm. Finally, it presents the proposed MAC unit architecture which integrates the Vedic multiplier with the different carry-skip adder designs to achieve improved speed and energy efficiency compared to existing MAC units. The goal is to reduce multiplication delay and improve performance for applications like digital signal processing.
This document describes a research paper on designing a high-speed application-specific integrated circuit (ASIC) for complex number multiplication using concepts from Vedic mathematics. The paper aims to improve multiplication speed by eliminating carry propagation delays. It proposes a design that uses Vedic sutras to transform complex number multiplication into four real number multiplications and three additions. The design is implemented in VHDL or Verilog and synthesized using Xilinx tools. Simulation results show improvements in propagation delay, power consumption, and area compared to other complex multiplier designs.
The use of reversible logic gates in the design of residue number systems IJECEIAES
Reversible computing is an emerging technique to achieve ultra-low-power circuits. Reversible arithmetic circuits allow for achieving energy-efficient high-performance computational systems. Residue number systems (RNS) provide parallel and fault-tolerant additions and multiplications without carry propagation between residue digits. The parallelism and fault-tolerance features of RNS can be leveraged to achieve high-performance reversible computing. This paper proposed RNS full reversible circuits, including forward converters, modular adders and multipliers, and reverse converters used for a class of RNS moduli sets with the composite form {2 k p , 2 -1}. Modulo 2 n -1, 2 n , and 2 n +1 adders and multipliers were designed using reversible gates. Besides, reversible forward and reverse converters for the 3-moduli set {2 n -1, 2 n+k n , 2 +1} have been designed. The proposed RNS- based reversible computing approach has been applied for consecutive multiplications with an improvement of above 15% in quantum cost after the twelfth iteration, and above 27% in quantum depth after the ninth iteration. The findings show that the use of the proposed RNS-based reversible computing in convolution results in a significant improvement in quantum depth in comparison to conventional methods based on weighted binary adders and multipliers.
A MULTI-OBJECTIVE PERSPECTIVE FOR OPERATOR SCHEDULING USING FINEGRAINED DVS A...VLSICS Design
The stringent power budget of fine grained power managed digital integrated circuits have driven chip designers to optimize power at the cost of area and delay, which were the traditional cost criteria for circuit optimization. The emerging scenario motivates us to revisit the classical operator scheduling problem under the availability of DVFS enabled functional units that can trade-off cycles with power. We study the design space defined due to this trade-off and present a branch-and-bound(B/B) algorithm to explore this state space and report the pareto-optimal front with respect to area and power. The scheduling also aims at maximum resource sharing and is able to attain sufficient area and power gains for complex benchmarks when timing constraints are relaxed by sufficient amount. Experimental results show that the algorithm that operates without any user constraint(area/power) is able to solve the problem for mostavailable benchmarks, and the use of power budget or area budget constraints leads to significant performance gain.
Analysis of different multiplication algorithm and FPGA implementation of rec...IRJET Journal
The document describes a new recursive barrel shifter algorithm for multiplication and its FPGA implementation. It analyzes existing multiplication algorithms like Booth, Wallace tree, Karatsuba and their limitations. The proposed algorithm uses a barrel shifter recursively by counting the number of ones in each number, shifting the multiplicand by powers of two, and adding the results. This is implemented on a Xilinx FPGA for performance analysis in terms of speed, power and area.
Multipliers play an important role in today’s digital signal processing (DSP) and various other
applications. Multiplication is the most time consuming process in various signal processing operations like
convolution, circular convolution, auto-correlation and cross-correlation. With advances in technology, many
researchers have tried and are trying to design multipliers which offer either of the following- high speed, low
power consumption, regularity of layout and hence less area or even combination of them in multiplier. However
area and speed are two conflicting constraints. So improving speed results always in larger areas. So here we try
to find out the best trade off solution among the both of them. To have features like high speed and low power
consumption multipliers several algorithms have been introduced .In this paper, we describes Multipliers by using
various algorithm in VLSI technology.
Design of Efficient High Speed Vedic Multiplierijsrd.com
Multipliers are extensively used in Microprocessors, DSP and Communication applications. For higher order multiplications, a huge number of adders are to be used to perform the partial product addition. This paper proposed the design of high speed Vedic Multiplier using the techniques of Ancient Indian Vedic Mathematics that have been modified to improve performance. Vedic Mathematics is the ancient system of mathematics which has a unique technique of calculations based on 16 Sutras. The work has proved the efficiency of Urdhva Triyagbhyam. It enables parallel generation of intermediate products, eliminates unwanted multiplication steps. Urdhva tiryakbhyam Sutra is most efficient Sutra (Algorithm), giving minimum delay for multiplication of all types of numbers, either small or large.
In this project 31 % area delay product reduction is possible with the use of the CSLA based 32 bit unsigned parallel multiplier than CLAA based 32 bit unsigned parallel multiplier
This document discusses the design of a pipelined architecture for sparse matrix-vector multiplication on an FPGA. It begins with introductions to matrices, linear algebra, and matrix multiplication. It then describes the objective of building a hardware processor to perform multiple arithmetic operations in parallel through pipelining. The document reviews literature on pipelined floating point units. It provides details on the proposed pipelined design for sparse matrix-vector multiplication, including storing vector values in on-chip memory and using multiple pipelines to complete results in parallel. Simulation results showing reduced power and execution time are presented before concluding the design can improve performance for scientific applications.
IMPLEMENTATION OF UNSIGNED MULTIPLIER USING MODIFIED CSLAeeiej_journal
This document discusses the implementation of an unsigned multiplier using a modified carry select adder technique. It begins with an introduction to digital arithmetic operations like multiplication and addition. It then describes the proposed system, which uses a modified carry select adder based multiplier to reduce area over a traditional carry look ahead adder based multiplier, while maintaining similar delay times. The document provides details on the design of regular and modified square root carry select adders used in the multiplier. It discusses how replacing ripple carry adders with binary to excess-1 converters in the modified design can further reduce area and power consumption.
Design and testing of systolic array multiplier using fault injecting schemesCSITiaesprime
Nowadays low power design circuits are major important for data transmission and processing the information among various system designs. One of the major multipliers used for synchronizing the data transmission is the systolic array multiplier, low power designs are mostly used for increasing the performance and reducing the hardware complexity. Among all the mathematical operations, multiplier plays a major role where it processes more information and with the high complexity of circuit in the existing irreversible design. We develop a systolic array multiplier using reversible gates for low power appliances, faults and coverage of the reversible logic are calculated in this paper. To improvise more, we introduced a reversible logic gate and tested the reversible systolic array multiplier using the fault injection method of built-in self-test block observer (BILBO) in which all corner cases are covered which shows 97% coverage compared with existing designs. Finally, Xilinx ISE 14.7 was used for synthesis and simulation results and compared parameters with existing designs which prove more efficiency.
Adiabatic technique based low power synchronous counter designIJECEIAES
The performance of integrated circuits is evaluated by their design architecture, which ensures high reliability and optimizes energy. The majority of the system-level architectures consist of sequential circuits. Counters are fundamental blocks in numerous very large-scale integration (VLSI) applications. The T-flip-flop is an important block in synchronous counters, and its high-power consumption impacts the overall effectiveness of the system. This paper calculates the power dissipation (PD), power delay product (PDP), and latency of the presented T flip-flop. To create a 2-bit synchronous counter based on the novel T flip-flops, a performance matrix such as PD, latency, and PDP is analyzed. The analysis is carried out at 100 and 10 MHz frequencies with varying temperatures and operating voltages. It is observed that the presented counter design has a lesser power requirement and PDP compared to the existing counter architectures. The proposed T-flip-flop design at the 45 nm technology node shows an improvement of 30%, 76%, and 85% in latency, PD, and PDP respectively to the 180 nm node at 10 MHz frequency. Similarly, the proposed counter at the 45 nm technology node shows 96% and 97% improvement in power dissipation, delay, and PDP respectively compared to the 180 nm at 10 MHz frequency.
Similar to An Efficient Design of 16 Bit MAC Unit using Vedic Mathematics (20)
Applications of artificial Intelligence in Mechanical Engineering.pdfAtif Razi
Historically, mechanical engineering has relied heavily on human expertise and empirical methods to solve complex problems. With the introduction of computer-aided design (CAD) and finite element analysis (FEA), the field took its first steps towards digitization. These tools allowed engineers to simulate and analyze mechanical systems with greater accuracy and efficiency. However, the sheer volume of data generated by modern engineering systems and the increasing complexity of these systems have necessitated more advanced analytical tools, paving the way for AI.
AI offers the capability to process vast amounts of data, identify patterns, and make predictions with a level of speed and accuracy unattainable by traditional methods. This has profound implications for mechanical engineering, enabling more efficient design processes, predictive maintenance strategies, and optimized manufacturing operations. AI-driven tools can learn from historical data, adapt to new information, and continuously improve their performance, making them invaluable in tackling the multifaceted challenges of modern mechanical engineering.
Levelised Cost of Hydrogen (LCOH) Calculator ManualMassimo Talia
The aim of this manual is to explain the
methodology behind the Levelized Cost of
Hydrogen (LCOH) calculator. Moreover, this
manual also demonstrates how the calculator
can be used for estimating the expenses associated with hydrogen production in Europe
using low-temperature electrolysis considering different sources of electricity
Open Channel Flow: fluid flow with a free surfaceIndrajeet sahu
Open Channel Flow: This topic focuses on fluid flow with a free surface, such as in rivers, canals, and drainage ditches. Key concepts include the classification of flow types (steady vs. unsteady, uniform vs. non-uniform), hydraulic radius, flow resistance, Manning's equation, critical flow conditions, and energy and momentum principles. It also covers flow measurement techniques, gradually varied flow analysis, and the design of open channels. Understanding these principles is vital for effective water resource management and engineering applications.
Generative AI Use cases applications solutions and implementation.pdfmahaffeycheryld
Generative AI solutions encompass a range of capabilities from content creation to complex problem-solving across industries. Implementing generative AI involves identifying specific business needs, developing tailored AI models using techniques like GANs and VAEs, and integrating these models into existing workflows. Data quality and continuous model refinement are crucial for effective implementation. Businesses must also consider ethical implications and ensure transparency in AI decision-making. Generative AI's implementation aims to enhance efficiency, creativity, and innovation by leveraging autonomous generation and sophisticated learning algorithms to meet diverse business challenges.
https://www.leewayhertz.com/generative-ai-use-cases-and-applications/
Blood finder application project report (1).pdfKamal Acharya
Blood Finder is an emergency time app where a user can search for the blood banks as
well as the registered blood donors around Mumbai. This application also provide an
opportunity for the user of this application to become a registered donor for this user have
to enroll for the donor request from the application itself. If the admin wish to make user
a registered donor, with some of the formalities with the organization it can be done.
Specialization of this application is that the user will not have to register on sign-in for
searching the blood banks and blood donors it can be just done by installing the
application to the mobile.
The purpose of making this application is to save the user’s time for searching blood of
needed blood group during the time of the emergency.
This is an android application developed in Java and XML with the connectivity of
SQLite database. This application will provide most of basic functionality required for an
emergency time application. All the details of Blood banks and Blood donors are stored
in the database i.e. SQLite.
This application allowed the user to get all the information regarding blood banks and
blood donors such as Name, Number, Address, Blood Group, rather than searching it on
the different websites and wasting the precious time. This application is effective and
user friendly.
A high-Speed Communication System is based on the Design of a Bi-NoC Router, ...DharmaBanothu
The Network on Chip (NoC) has emerged as an effective
solution for intercommunication infrastructure within System on
Chip (SoC) designs, overcoming the limitations of traditional
methods that face significant bottlenecks. However, the complexity
of NoC design presents numerous challenges related to
performance metrics such as scalability, latency, power
consumption, and signal integrity. This project addresses the
issues within the router's memory unit and proposes an enhanced
memory structure. To achieve efficient data transfer, FIFO buffers
are implemented in distributed RAM and virtual channels for
FPGA-based NoC. The project introduces advanced FIFO-based
memory units within the NoC router, assessing their performance
in a Bi-directional NoC (Bi-NoC) configuration. The primary
objective is to reduce the router's workload while enhancing the
FIFO internal structure. To further improve data transfer speed,
a Bi-NoC with a self-configurable intercommunication channel is
suggested. Simulation and synthesis results demonstrate
guaranteed throughput, predictable latency, and equitable
network access, showing significant improvement over previous
designs
2. 2 Manoj Kumar et al.
of any DSP block. The better presentation of the MAC
unit satisfies the boundary of quick calculation and ongo-
ing preparing capacities of a DSP. Throughout the long
term, various thoughts have been proposed to improve
the presentation and alleviate the over-the-top incom-
plete item term age during the traditional augmentation
approach. In this paper, we have zeroed in on propos-
ing the MAC design utilizing a coordinated Hybrid paired
Multiplier and incorporated CLA viper organization. The
coordinated multiplier is a mix of the Karatsuba calcula-
tion and Urdhva Triyagbhyamsutra from Vedic math. CLA
viper network comprises of CLA and restrictive whole
snake which assists with decreasing expansion time by per-
forming equal expansion.
“Parallel Multiplier-accumulator Unit based on
Vedic Mathematics”, Jithin S, Prabhu E
In this paper, a compelling equivalent multiplier and
gatherer (MAC) unit reliant on Vedic math is presented.
Vedic science utilizes the Urdhva-tiryagbhyam sutra for
the multiplier plan. The proposed MAC configuration
overhauls the speed of movement while diminishing
the doorway zone and power dispersing. We in like
manner achieve an improved deferral with the help of
the Vedic encoder followed by the departure of the finder
stage by parallelizing the midway results dealing with
the information. Such pipelining of the midway results,
before the last snake, merges the aggregator stage with
the fragmentary thing period of the multiplier. Further,
the overall computation speed of the MAC unit is raised
by the successful usage of higher-demand blowers in
the consolidated inadequate thing pressing factor and
gatherer (PPCA) designing. The region, timing, and power
reports show that the fundamental path deferment of the
proposed setup is by and largely decreased and it beats the
current plans. We report level out the progress of 20–30%
and 7–18% separately for the 4-cycle and 8-digit Vedic
MAC units, with respect to their full-scale circuit power,
essential way delay, and cell zone. The plan was mixed
using a standard 90 nm CMOS library and executed on
Altera’s Cyclone II course of action FPGA.
“Design and Optimization of 16 × 16 Bit Multi-
plier Using Vedic Mathematics”, S. N. Gadakh
and A. K. Khade
Enlargement is a critical cutoff in the measure of chang-
ing tasks. Development-based activities, for example,
duplicate and Accumulate unit (MAC), convolution, Fast
Fourier Transform (FFT), isolating are by and large uti-
lized in signal managing applications. As duplication over-
whelms the execution period of DSP structures, there is
a need to create fast multipliers. Old Vedic mathematical
longings the reaction fairly. In this paper, the chance
of Urdhwa-Tiryagbhyam is utilized i.e., vertically and
momentarily amplification to execute a 16 × 16 Bit Vedic
multiplier, and improvement is made by utilizing the pass
on saving adders. Secluding and past plans, the proposed
configuration accomplishes a 33.26% reducing in com-
binational way delay. The Vedic multiplier proposed is
executed in VHDL while joined and imitated utilizing Xil-
inx ISE Design Suite 14.5.
“Low Power High Speed 16 × 16 bit Multiplier
using Vedic Mathematics”, K. Bathija, R & S.
Meena, R & Sarkar, S & Sahu, Rajesh
High-speed equivalent multipliers are one of the keys in
RISCs (Reduced Instruction Set Computers), DSPs (Dig-
ital Signal Processors), and delineations gas pedals, and
so on Arraymultiplier, Booth Multiplier, and Wallace Tree
multipliers are a bit of the standard approaches used in
the execution of combined multiplier which is sensible
for VLSI execution. An essential mechanized multiplier
(from now on insinuated as VedicMultiplier in short VM)
plan subject to the Urdhva Tiryakbhyam (Vertically and
Crosswise) Sutra of Vedic Mathematics is presented. An
improved system for low-power and quick multiplier of
two twofold numbers (16 cycles each) is made. A count
is proposed and executed on 16 nm CMOS advancement.
The arranged 16 × 16 piece multiplier disperses a power of
0.17 mW. The spread concedes period of the proposed con-
figuration is 27.15 ns. These results are various redesigns
overpower dispersals and concede declared in the compo-
sition for Vedic and Booth Multiplier.
“An Efficient Booth Multiplier Using Proba-
bilistic Approach”, M. V. Durga Pavan and
Ramesh, S. R.
In VLSI Design, low force decrease is accomplished by pri-
marily lessening the force. As of now, low-power plans
are transcendent in VLSI because of numerous reasons.
The fundamental center is to decrease the warmth in the
gadget. From the essential numerical conditions of force,
a decrease of force should be possible by either dimin-
ishing clock, diminishing voltage, or diminishing burden.
The alternative of diminishing force should be possible by
lessening voltage as timekeepers ought to be kept up for
quicker frameworks. Force decrease should be possible at
different levels like design, rationale, and semiconductor.
A decrease of force and zone should be possible by for-
feiting one factor to accomplish the other. In this work, a
corner multiplier is planned dependent on a probabilistic
methodology. In the truncation part of incomplete items,
a probabilistic assessment inclination circuit is presented.
Wave Carry Adder (RCA) was supplanted with a convey-
ing Look Ahead (CLA) adder in the execution. Reproduc-
tions were done utilizing Synopsys Design Compiler for
3. An Efficient Design of 16 Bit MAC Unit using Vedic Mathematics 3
saed 90 nm innovation. 9.7% area decrease and 3.9% power
decrease were accounted for L = 8 and L = 10 when con-
trasted and existing work.
Exsisting System
An important function of an arithmetic block is multiplica-
tion because, in most mathematical computations, it forms
the bulk of the execution time. Thus, the development of a
fast multiplier has been a key research area for a long time.
Vedic Mathematics is a methodology of arithmetic rules
that allows for more efficient implementations regarding
speed. Multiplication in this methodology consists of three
steps: generation of partial products, reduction of partial
products, and finally carry propagate addition. Multiplier
design based on Vedic mathematics has many advantages
as the partial products and sums are generated in one step,
which reduces the carry propagation from LSB to MSB.
This feature helps in scaling the design for larger inputs
without proportionally increasing the propagation delay as
all smaller blocks of the design work concurrently.
Proposed System
Vedic multiplier plans proposed in the composing rely
upon Urdhva Tiryagbhyam and Nikhilam sutras of Vedic
Mathematics. As Nikhil sutra is only beneficial for inputs
that are close to the power of 10, in this paper an arrange-
ment to perform high-speed increase reliant on the Urdhva
Tiryagbhyam sutra of Vedic Mathematics which is a sum-
marized technique for all numbers, has been presented.
An arrangement of snake plans has been proposed in the
composition to update the introduction of the Vedic mul-
tiplier. In this paper, a novel execution of a snake reliant
on CSA is proposed, which reduces the pass-on incit-
ing delay in the arrangement by using passing on free
math. The proposed snake setup manages a mutt of equal
and quaternary number structures wherein the absolute
is directly delivered twofold using the possibility of an
evolving piece, executing the change module. Vedic-math
is an old technique that can be clearly utilized in various
pieces of science like polynomial math, calculating, etc.
It lessens the multifaceted nature by killing the pointless
advances while learning any result. There are 16 sutras in
Vedic-math.
Module Explanation
Among the over 16 sutras, Urdhva Tiryakbhyam (UT) and
Nikhilam Navatashcaramam Dashatah (NND) are utilized
for processing the duplication of any two numbers. For the
most part, the NND sutra is liked for bigger piece numbers
and the UT sutra is liked for more modest piece numbers.
Thus UT sutra is utilized in this work.
Basic MAC
Implementation of 2 Bit Multiplier
With HA’S
Notwithstanding, the above plan isn’t appropriate for
higher-request multipliers as it prompts an expansion
in delay. Thus, a convey save viper is liked for adding
halfway items. Here halfway items are created in an equal
way very much like an exhibit multiplier.
Proposed 8 Bit Multiplier
The 8 bit Vedic-multiplier has been planned by four 4 bit
multipliers. Here the data sources a[7:0] and b[7:0] are iso-
lated into a[3:0], a[7:4], b[3:0], b[7:4] separately, and took
care of as contributions to the multipliers and an eventual
4. 4 Manoj Kumar et al.
outcome is a 16-cycle number. Figure 4 addresses the pro-
posed design for the 8 bit multiplier. Conclusion
By Comparing both the Existing Vedic multiplier and pro-
posed Vedic multiplier, it is seen that the Proposed Vedic
multiplier improves the deferment. Thusly, it is surmised
that a multiplier that requires uncommonly fast execution
can use such a multiplier in picture and sign taking care of
utilizations.
References
[1] Dwivedi, Kavindra & Sharma Sharma, R. K. & Chunduri, Ajay.
“Hybrid Multiplier-Based Optimized MAC Unit”, 2018 9th Inter-
national Conference on Computing, Communication and Network-
ing Technologies (ICCCNT), Bangalore, 2018, pp. 1–4.
[2] Jithin, S., Prabhu, E. “Parallel Multiplier – Accumulator Unit based
on Vedic Mathematics”, in ARPN Journal of Engineering and
Applied Sciences, Vol. 10, no. 8, pp. 3608–3613, May 2015.
[3] S. N. Gadakh and A. K. Khade. “Design and Optimization of
16 × 16 Bit Multiplier Using Vedic Mathematics”, in proc. Int. Conf.
on Automatic Control and Dynamic Optimization Techniques, 2016.
[4] K. Bathija, R & S. Meena, R & Sarkar, S & Sahu, Rajesh. “Low
Power High Speed 16 × 16 bit Multiplier using Vedic Mathemat-
ics”, in International Journal of Computer Applications. 59. 41–44.
10.5120/9556-4016.
[5] M. V. Durga Pavan and Ramesh, S. R. “An Efficient Booth Multi-
plier Using Probabilistic Approach”, in 2018 International Confer-
ence on Communication and Signal Processing (ICCSP), Chennai,
2018, pp. 365–368.
[6] L. Ranganath, D. Jay Kumar, P. Siva Nagendra Reddy. “Design of
MAC Unit in Artificial Neural Network Architecture using Verilog
HDL”, in International conference on Signal Processing, Communi-
cation, Power and Embedded System (SCOPES)-2016.
[7] Carry-Save Addition. Prof. Loh. CS3220 – Processor Design – Spring
2005.
[8] R. Balakumaran and E. Prabhu. “Design of high speed multiplier
using modified booth algorithm with hybrid carry look-ahead
adder”, in 2016 International Conference on Circuit, Power and
Computing Technologies (ICCPCT), Nagercoil, 2016, pp. 1–7.
[9] A. Eshack and S. Krishnakumar. “Implementation of Pipelined
Low Power Vedic Multiplier”, in 2nd International Conference on
Trends in Electronics and Informatics (ICOEI), Tirunelveli, 2018,
pp. 171–174.
[10] S. Rakesh and K. S. V. Grace. “A survey on the design
and performance of various MAC unit architectures”, in 2017
IEEE International Conference on Circuits and Systems (ICCS),
Thiruvananthapuram, 2017, pp. 312–315.