This document describes the design of high-performance 8-bit, 16-bit, and 32-bit Vedic multipliers using SCL PDK 180nm technology. It discusses the need for fast low-power multipliers in applications like DSP. Vedic multiplication algorithms and architectures for proposed multipliers are presented. Performance analysis shows post-layout propagation delays of 1.4ns, 3.6ns, and not reported for 8-bit, 16-bit, and 32-bit multipliers respectively. Power dissipation is also reported. Hardware implementation including padring is discussed and layout shown occupying 1.89mm2.
This seminar report summarizes the design and implementation of a floating point multiplier using Vedic multiplication techniques on an FPGA. It describes the key components of a floating point multiplier, reviews existing multiplication algorithms, and introduces the ancient Vedic multiplication method. The report outlines the design of a proposed 32-bit floating point Vedic multiplier, including mantissa, exponent, and sign calculation units. Experimental results show the Vedic multiplier utilizes 9% of slices on the target FPGA and has a maximum delay of 18.872ns, demonstrating its advantages over other multipliers in terms of speed and area efficiency.
Implementation of Vedic multipliers using urdhwa triyakbhyam sutraGana Thennira
This document presents a summary of Vedic multipliers designed based on principles of Vedic mathematics. It discusses how Vedic multipliers can improve the speed of multiplication operations commonly used in digital signal processing applications by reducing complex calculations. Specifically, it proposes implementing the reversible Urdhva Tiryagbhyam multiplier to reduce area and power dissipation compared to existing array and Booth multipliers. Examples and applications of the Urdhva Tiryagbhyam algorithm are provided. Advantages of Vedic multipliers include faster speed, lower power consumption and more efficient scaling to larger bit sizes, though carry propagation delay may increase for large numbers.
DESIGN AND SIMULATION OF DIFFERENT 8-BIT MULTIPLIERS USING VERILOG CODE BY SA...Saikiran Panjala
This document describes the design and simulation of different 8-bit multipliers using Verilog code. It summarizes four multipliers: array, Wallace tree, Baugh-Wooley, and Vedic. It finds that the Baugh-Wooley multiplier has advantages in speed, delay, area, complexity, and power consumption compared to the other multipliers. The document also discusses half adders, full adders, ripple carry adders, carry save adders, and multiplication algorithms. It aims to compare the multipliers based on area, speed, and delay.
This document describes the design of a Wallace tree multiplier using Verilog. It discusses different types of multipliers such as array, serial/parallel, and Booth multipliers. It provides details on the Wallace tree multiplier design including its block diagram, partitioning of partial products, number of levels, submodules like AND gates and full adders, and comparison of its power consumption and results. The dumping process in an FPGA kit is also covered along with the advantage of small delay and disadvantage of complex layout for the Wallace tree multiplier.
The proposed Vedic multiplier is based on traditional Vedic Sutras multiplication techniques that were used to multiply numbers in the decimal system. It uses the "Urdhva Tiryagbhyam Sutra" and "Nikhilam Sutra" to multiply two numbers faster and with less area than other multipliers like booth and array multipliers. The Vedic multiplier proves to be highly efficient for applications like digital signal processing in terms of both speed and smaller area compared to other designs.
The document describes the principles and implementation of an array multiplier. It discusses how array multipliers generate partial products simultaneously using parallel logic, making them faster than serial multipliers. A 4x4 bit array multiplier is implemented in Verilog using AND gates and adders, and its functionality is verified through simulation. While array multipliers require more gates and area than serial multipliers, their performance can be increased using pipelining. The document concludes that array multiplication is well-suited for applications requiring high speed.
This document proposes a multiply-accumulate (MAC) unit architecture using a multiplier based on the Vedic mathematics sutra of Urdhva Tiryagbhyam. It describes how the sutra can be used to simplify binary multiplications by breaking them into smaller 2x2 multiplications that can be performed in parallel. The proposed Vedic mathematics based MAC unit is shown to be highly efficient in terms of speed due to its regular and parallel structure.
This document presents a study on the implementation of a Vedic multiplier using an FPGA. It begins with background on Vedic mathematics and its application to multiplication. It then describes the design of a 4-bit Vedic multiplier using the concept of partial product generation and addition. The hardware implementation is presented, including schematic diagrams and simulation results. It is concluded that the Vedic multiplier design requires fewer logic resources and is more efficient than other multiplier designs.
This seminar report summarizes the design and implementation of a floating point multiplier using Vedic multiplication techniques on an FPGA. It describes the key components of a floating point multiplier, reviews existing multiplication algorithms, and introduces the ancient Vedic multiplication method. The report outlines the design of a proposed 32-bit floating point Vedic multiplier, including mantissa, exponent, and sign calculation units. Experimental results show the Vedic multiplier utilizes 9% of slices on the target FPGA and has a maximum delay of 18.872ns, demonstrating its advantages over other multipliers in terms of speed and area efficiency.
Implementation of Vedic multipliers using urdhwa triyakbhyam sutraGana Thennira
This document presents a summary of Vedic multipliers designed based on principles of Vedic mathematics. It discusses how Vedic multipliers can improve the speed of multiplication operations commonly used in digital signal processing applications by reducing complex calculations. Specifically, it proposes implementing the reversible Urdhva Tiryagbhyam multiplier to reduce area and power dissipation compared to existing array and Booth multipliers. Examples and applications of the Urdhva Tiryagbhyam algorithm are provided. Advantages of Vedic multipliers include faster speed, lower power consumption and more efficient scaling to larger bit sizes, though carry propagation delay may increase for large numbers.
DESIGN AND SIMULATION OF DIFFERENT 8-BIT MULTIPLIERS USING VERILOG CODE BY SA...Saikiran Panjala
This document describes the design and simulation of different 8-bit multipliers using Verilog code. It summarizes four multipliers: array, Wallace tree, Baugh-Wooley, and Vedic. It finds that the Baugh-Wooley multiplier has advantages in speed, delay, area, complexity, and power consumption compared to the other multipliers. The document also discusses half adders, full adders, ripple carry adders, carry save adders, and multiplication algorithms. It aims to compare the multipliers based on area, speed, and delay.
This document describes the design of a Wallace tree multiplier using Verilog. It discusses different types of multipliers such as array, serial/parallel, and Booth multipliers. It provides details on the Wallace tree multiplier design including its block diagram, partitioning of partial products, number of levels, submodules like AND gates and full adders, and comparison of its power consumption and results. The dumping process in an FPGA kit is also covered along with the advantage of small delay and disadvantage of complex layout for the Wallace tree multiplier.
The proposed Vedic multiplier is based on traditional Vedic Sutras multiplication techniques that were used to multiply numbers in the decimal system. It uses the "Urdhva Tiryagbhyam Sutra" and "Nikhilam Sutra" to multiply two numbers faster and with less area than other multipliers like booth and array multipliers. The Vedic multiplier proves to be highly efficient for applications like digital signal processing in terms of both speed and smaller area compared to other designs.
The document describes the principles and implementation of an array multiplier. It discusses how array multipliers generate partial products simultaneously using parallel logic, making them faster than serial multipliers. A 4x4 bit array multiplier is implemented in Verilog using AND gates and adders, and its functionality is verified through simulation. While array multipliers require more gates and area than serial multipliers, their performance can be increased using pipelining. The document concludes that array multiplication is well-suited for applications requiring high speed.
This document proposes a multiply-accumulate (MAC) unit architecture using a multiplier based on the Vedic mathematics sutra of Urdhva Tiryagbhyam. It describes how the sutra can be used to simplify binary multiplications by breaking them into smaller 2x2 multiplications that can be performed in parallel. The proposed Vedic mathematics based MAC unit is shown to be highly efficient in terms of speed due to its regular and parallel structure.
This document presents a study on the implementation of a Vedic multiplier using an FPGA. It begins with background on Vedic mathematics and its application to multiplication. It then describes the design of a 4-bit Vedic multiplier using the concept of partial product generation and addition. The hardware implementation is presented, including schematic diagrams and simulation results. It is concluded that the Vedic multiplier design requires fewer logic resources and is more efficient than other multiplier designs.
This document summarizes sections from a book on microcontroller solutions. It discusses 8-bit microcontrollers and provides examples of code. It covers topics like registers, ports, bit manipulation, timers, and interrupts. It gives code examples to blink LEDs, delay, use timers, and perform math operations with registers. Overall it provides an overview of programming and interfacing with an 8-bit microcontroller.
VLSI ARCHITECTURE OF AN 8-BIT MULTIPLIER USING VEDIC MATHEMATICS IN 180NM TEC...P singh
A Multiplier is one of the key hardware blocks in most fast processing system which requires less power dissipation. A conventional multiplier consumes more power. This paper presents a low power 8 bit Vedic Multiplier (VM) based on Vertically & Crosswise method of Vedic mathematics, a general multiplication formulae equally applicable to all cases of multiplication. It is based on generating all partial products and their sum in one step. The implementation is done using cadence Virtuoso tool. The power dissipation of 8x8 bit Vedic multiplier obtained after synthesis is compared with conventional multipliers such as Wallace tree and array multipliers and found that the proposed Vedic multiplier circuit seems to have better performance in terms of power dissipation.
This document describes a student's 4-bit serial multiplier project. It includes an abstract, introduction, multiplication algorithm description, component descriptions, Verilog code, test bench, and expected output. The project was designed and tested using Xilinx tools to multiply 4-bit numbers in a serial fashion using basic logic gates like AND gates and adders. The student provides documentation of the design process and codes to verify the serial multiplication functionality.
Frequency-Shift Keying, also known as FSK is a type of digital frequency modulation. It is also often called as binary frequency shift keying or BFSK
Similar to analog FM, it is a constant-amplitude angle modulation.
This presentation will discuss the concepts behind FSK
Logic Level Techniques for Power Reduction GargiKhanna1
This document discusses various logic level techniques for low power VLSI design, including:
- Gate reorganization techniques like combining gates to reduce switching activity.
- Signal gating to block propagation of unwanted signals using AND/OR gates or latches.
- Logic encoding methods like gray code counting to reduce bit transitions.
- State machine encoding to lower expected bit transitions in the state register and outputs.
- Precomputation logic that disables inputs to combinational logic when output is invariant, reducing switching activity at the cost of increased area.
This document discusses the implementation of fast multiplier architectures for convolution applications in signal processing. It examines Vedic multipliers, column bypass multipliers, and multipliers using compressors. Circuit diagrams and simulation results are presented for 4-bit, 8-bit, and 16-bit multipliers. Synthesis results on a Xilinx FPGA show the resource utilization and performance of each multiplier type. Applications of these multipliers include convolution, DSP processors, and fast Fourier transforms.
Lecture Notes: EEEC6440315 Communication Systems - Inter Symbol Interference...AIMST University
This document discusses inter-symbol interference (ISI) that occurs when pulses transmitted through a band-limited channel spread into adjacent time slots, and various pulse shaping techniques to eliminate ISI. It explains that rectangular pulses cause ISI in practical band-limited channels, and introduces Nyquist's criterion for zero-ISI transmission. The document also describes raised cosine pulse shaping, which is commonly used when the symbol rate is less than the Nyquist rate, and provides an example of its use in WCDMA cellular systems.
Precision current sources - Low noise current mirrorsJaved G S, PhD
Design techniques and methods to design precision current mirrors, precision current sources. In this work, I have discussed methods to reduce noise and variations in the reference current generation.
1. Negative feedback control
2. Applying filters in the design
3. Calibration
4. Resister Trimming
In communication system, intersymbol interference (ISI) is a form of distortion of a signal in which one symbol interferes with subsequent symbols. This is an unwanted phenomenon as the previous symbols have similar effect as noise, thus making the communication less reliable.
In communication system, the Nyquist ISI criterion describes the conditions which when satisfied by a communication channel (including responses of transmit and receive filters), result in no intersymbol interference(ISI). It provides a method for constructing band-limited functions to overcome the effects of intersymbol interference.
VLSI subsystem design processes and illustrationVishal kakade
This document discusses the design processes for digital subsystem design. It begins by outlining the objectives of design consideration, problem and solution, basic digital processor structure, and datapath. It then discusses general considerations for subsystem design such as lower unit cost and higher reliability. It presents some common problems in design like how to design complex systems efficiently. It proposes solutions like top-down design and partitioning the system. The document then illustrates the design processes through examples like designing a 4-bit shifter and ALU subsystem. It provides block diagrams, logic diagrams and layouts at different stages of the design process.
Simulation power analysis low power vlsiGargiKhanna1
The document discusses various simulation techniques used to estimate power dissipation at different levels of abstraction. It describes the tradeoff between computing resources and accuracy at different levels from algorithm to transistor level. SPICE circuit simulation provides the most accurate results but requires significant computing power. Higher levels of abstraction like gate level, switch level and architecture level analyses provide faster simulation speed at the cost of reduced accuracy. Power models are developed based on activities, component operations and data correlation to capture power at architecture level for large designs.
The document discusses various topics related to digital transmission including:
1. Digital-to-digital conversion techniques like line coding, block coding, and scrambling that are used to represent digital data with digital signals. Line coding is always needed while block coding and scrambling may or may not be needed.
2. Analog-to-digital conversion techniques like pulse code modulation (PCM) and delta modulation that are used to convert analog signals to digital data. PCM involves sampling, quantization, and encoding of analog signals.
3. Transmission modes including parallel transmission of multiple bits together and serial transmission of one bit at a time. Serial transmission can be asynchronous, synchronous, or isochronous depending
1) The document discusses finite word length effects in digital filters. It covers fixed point and floating point number representations, different number systems including binary, decimal, octal and hexadecimal.
2) It describes various number representation techniques for digital systems including fixed point representation, floating point representation, and block floating point representation. Fixed point representation uses a fixed binary point position while floating point representation allows the binary point to vary.
3) It also discusses signed number representations including sign-magnitude, one's complement, and two's complement forms. Arithmetic operations like addition, subtraction and multiplication are covered for fixed point numbers along with issues like overflow.
The document discusses various techniques for accelerating the multiplication process, including shift-and-add, Booth's recoding, and higher radix multipliers. Booth's recoding maps digit sets to [-1,1] to skip additions when partial products are zero. Modified Booth's recoding improves on this by considering three adjacent bits to encode multipliers into [-2,2], allowing the use of radix-4 grouping to reduce the number of partial product additions. Modern multipliers apply Modified Booth's Recoding to take advantage of its higher radix structure.
This presentation contain each and every single information on the topic.
If you like it do follow and like my presentation.
It would be worth my efforts.
This document describes the design of optimized reversible Vedic multipliers for high-speed low-power operations. It presents 2x2, 4x4, and 8x8 bit reversible Vedic multipliers based on the Urdhva Tiryakbhyam multiplication algorithm. The multipliers were designed using reversible logic gates like Feynman, Peres, and HNG gates. Simulation results showed the reversible Vedic multipliers have lower time delay, area, and number of logic units compared to normal Vedic multipliers. Potential applications of these high-speed low-power multipliers include fast Fourier transforms, public key cryptography, and embedded systems.
Fpga implementation of high speed 8 bit vedic multiplier using barrel shifter(1)Karthik Sagar
This document describes the implementation of an 8-bit Vedic multiplier using a barrel shifter on an FPGA. It begins with an introduction to Vedic mathematics and the Nikhilam sutra technique for multiplication. This technique reduces the number of partial products generated. The design uses a 64-bit barrel shifter in the base selection module and multiplier to significantly reduce the propagation delay compared to conventional multipliers. The 8-bit Vedic multiplier was implemented on a Xilinx Spartan-6 FPGA. Simulation results showed the design achieved a propagation delay of 6.781ns, demonstrating the speed improvement from using a barrel shifter.
This document summarizes sections from a book on microcontroller solutions. It discusses 8-bit microcontrollers and provides examples of code. It covers topics like registers, ports, bit manipulation, timers, and interrupts. It gives code examples to blink LEDs, delay, use timers, and perform math operations with registers. Overall it provides an overview of programming and interfacing with an 8-bit microcontroller.
VLSI ARCHITECTURE OF AN 8-BIT MULTIPLIER USING VEDIC MATHEMATICS IN 180NM TEC...P singh
A Multiplier is one of the key hardware blocks in most fast processing system which requires less power dissipation. A conventional multiplier consumes more power. This paper presents a low power 8 bit Vedic Multiplier (VM) based on Vertically & Crosswise method of Vedic mathematics, a general multiplication formulae equally applicable to all cases of multiplication. It is based on generating all partial products and their sum in one step. The implementation is done using cadence Virtuoso tool. The power dissipation of 8x8 bit Vedic multiplier obtained after synthesis is compared with conventional multipliers such as Wallace tree and array multipliers and found that the proposed Vedic multiplier circuit seems to have better performance in terms of power dissipation.
This document describes a student's 4-bit serial multiplier project. It includes an abstract, introduction, multiplication algorithm description, component descriptions, Verilog code, test bench, and expected output. The project was designed and tested using Xilinx tools to multiply 4-bit numbers in a serial fashion using basic logic gates like AND gates and adders. The student provides documentation of the design process and codes to verify the serial multiplication functionality.
Frequency-Shift Keying, also known as FSK is a type of digital frequency modulation. It is also often called as binary frequency shift keying or BFSK
Similar to analog FM, it is a constant-amplitude angle modulation.
This presentation will discuss the concepts behind FSK
Logic Level Techniques for Power Reduction GargiKhanna1
This document discusses various logic level techniques for low power VLSI design, including:
- Gate reorganization techniques like combining gates to reduce switching activity.
- Signal gating to block propagation of unwanted signals using AND/OR gates or latches.
- Logic encoding methods like gray code counting to reduce bit transitions.
- State machine encoding to lower expected bit transitions in the state register and outputs.
- Precomputation logic that disables inputs to combinational logic when output is invariant, reducing switching activity at the cost of increased area.
This document discusses the implementation of fast multiplier architectures for convolution applications in signal processing. It examines Vedic multipliers, column bypass multipliers, and multipliers using compressors. Circuit diagrams and simulation results are presented for 4-bit, 8-bit, and 16-bit multipliers. Synthesis results on a Xilinx FPGA show the resource utilization and performance of each multiplier type. Applications of these multipliers include convolution, DSP processors, and fast Fourier transforms.
Lecture Notes: EEEC6440315 Communication Systems - Inter Symbol Interference...AIMST University
This document discusses inter-symbol interference (ISI) that occurs when pulses transmitted through a band-limited channel spread into adjacent time slots, and various pulse shaping techniques to eliminate ISI. It explains that rectangular pulses cause ISI in practical band-limited channels, and introduces Nyquist's criterion for zero-ISI transmission. The document also describes raised cosine pulse shaping, which is commonly used when the symbol rate is less than the Nyquist rate, and provides an example of its use in WCDMA cellular systems.
Precision current sources - Low noise current mirrorsJaved G S, PhD
Design techniques and methods to design precision current mirrors, precision current sources. In this work, I have discussed methods to reduce noise and variations in the reference current generation.
1. Negative feedback control
2. Applying filters in the design
3. Calibration
4. Resister Trimming
In communication system, intersymbol interference (ISI) is a form of distortion of a signal in which one symbol interferes with subsequent symbols. This is an unwanted phenomenon as the previous symbols have similar effect as noise, thus making the communication less reliable.
In communication system, the Nyquist ISI criterion describes the conditions which when satisfied by a communication channel (including responses of transmit and receive filters), result in no intersymbol interference(ISI). It provides a method for constructing band-limited functions to overcome the effects of intersymbol interference.
VLSI subsystem design processes and illustrationVishal kakade
This document discusses the design processes for digital subsystem design. It begins by outlining the objectives of design consideration, problem and solution, basic digital processor structure, and datapath. It then discusses general considerations for subsystem design such as lower unit cost and higher reliability. It presents some common problems in design like how to design complex systems efficiently. It proposes solutions like top-down design and partitioning the system. The document then illustrates the design processes through examples like designing a 4-bit shifter and ALU subsystem. It provides block diagrams, logic diagrams and layouts at different stages of the design process.
Simulation power analysis low power vlsiGargiKhanna1
The document discusses various simulation techniques used to estimate power dissipation at different levels of abstraction. It describes the tradeoff between computing resources and accuracy at different levels from algorithm to transistor level. SPICE circuit simulation provides the most accurate results but requires significant computing power. Higher levels of abstraction like gate level, switch level and architecture level analyses provide faster simulation speed at the cost of reduced accuracy. Power models are developed based on activities, component operations and data correlation to capture power at architecture level for large designs.
The document discusses various topics related to digital transmission including:
1. Digital-to-digital conversion techniques like line coding, block coding, and scrambling that are used to represent digital data with digital signals. Line coding is always needed while block coding and scrambling may or may not be needed.
2. Analog-to-digital conversion techniques like pulse code modulation (PCM) and delta modulation that are used to convert analog signals to digital data. PCM involves sampling, quantization, and encoding of analog signals.
3. Transmission modes including parallel transmission of multiple bits together and serial transmission of one bit at a time. Serial transmission can be asynchronous, synchronous, or isochronous depending
1) The document discusses finite word length effects in digital filters. It covers fixed point and floating point number representations, different number systems including binary, decimal, octal and hexadecimal.
2) It describes various number representation techniques for digital systems including fixed point representation, floating point representation, and block floating point representation. Fixed point representation uses a fixed binary point position while floating point representation allows the binary point to vary.
3) It also discusses signed number representations including sign-magnitude, one's complement, and two's complement forms. Arithmetic operations like addition, subtraction and multiplication are covered for fixed point numbers along with issues like overflow.
The document discusses various techniques for accelerating the multiplication process, including shift-and-add, Booth's recoding, and higher radix multipliers. Booth's recoding maps digit sets to [-1,1] to skip additions when partial products are zero. Modified Booth's recoding improves on this by considering three adjacent bits to encode multipliers into [-2,2], allowing the use of radix-4 grouping to reduce the number of partial product additions. Modern multipliers apply Modified Booth's Recoding to take advantage of its higher radix structure.
This presentation contain each and every single information on the topic.
If you like it do follow and like my presentation.
It would be worth my efforts.
This document describes the design of optimized reversible Vedic multipliers for high-speed low-power operations. It presents 2x2, 4x4, and 8x8 bit reversible Vedic multipliers based on the Urdhva Tiryakbhyam multiplication algorithm. The multipliers were designed using reversible logic gates like Feynman, Peres, and HNG gates. Simulation results showed the reversible Vedic multipliers have lower time delay, area, and number of logic units compared to normal Vedic multipliers. Potential applications of these high-speed low-power multipliers include fast Fourier transforms, public key cryptography, and embedded systems.
Fpga implementation of high speed 8 bit vedic multiplier using barrel shifter(1)Karthik Sagar
This document describes the implementation of an 8-bit Vedic multiplier using a barrel shifter on an FPGA. It begins with an introduction to Vedic mathematics and the Nikhilam sutra technique for multiplication. This technique reduces the number of partial products generated. The design uses a 64-bit barrel shifter in the base selection module and multiplier to significantly reduce the propagation delay compared to conventional multipliers. The 8-bit Vedic multiplier was implemented on a Xilinx Spartan-6 FPGA. Simulation results showed the design achieved a propagation delay of 6.781ns, demonstrating the speed improvement from using a barrel shifter.
1) The document presents designs for reversible logic gates and their applications in low power circuits. It proposes an improved design for a reversible programmable logic array (RPLA) using multiplexer and Feynman gates that is more efficient than existing designs.
2) It also proposes a method for structuring a reversible arithmetic logic unit (ALU) using reversible logic gates instead of traditional gates, achieving the same functionality with reduced information loss.
3) The RPLA design is demonstrated by implementing reversible 1-bit full adders and subtractors. Simulation results show the proposed design optimizes the number of reversible gates used.
Implementation and Performance Analysis of a Vedic Multiplier Using Tanner ED...ijsrd.com
high density, VLSI chips have led to rapid and innovative development in low power design during the recent years .The need for low power design is becoming a major issue in high performance digital systems such as microprocessor, digital signal processor and other applications. For these applications, Multiplier is the major core block. Based on the Multiplier design, an efficient processor is designed. Power and area efficient multiplier using CMOS logic circuits for applications in various digital signal processors is designed. This multiplier is implemented using Vedic multiplication algorithms mainly the "UrdhvaTriyakBhyam sutra., which is the most generalized one Vedic multiplication algorithm [1] . A multiplier is a very important element in almost all the processors and contributes substantially to the total power consumption of the system. The novel point is the efficient use of Vedic algorithm (sutras) that reduces the number of computational steps considerably compared with any conventional method . The schematic for this multiplier is designed using TANNER TOOL. Paper presents a systematic design methodology for this improved performance digital multiplier based on Vedic mathematics.
Seminar on Digital Multiplier(Booth Multiplier) Using VHDLNaseer LoneRider
This is my Mini project. It is very clear and has lots of animation in it. If you like to know about booth algorithm and VHDL this the perfect presentation. Download it and see as SLIDE SHOW. You will enjoy more of my work, Give blessings.
9.design of high speed area efficient low power vedic multiplier using revers...nareshbk
This document proposes designing a 4x4 Vedic multiplier using reversible logic gates. It discusses how traditional multipliers have high area, latency and power consumption. The Vedic multiplication algorithm called Urdhva Tiryagbhyam can increase speed compared to other techniques. Implementing this algorithm with reversible logic gates can further reduce area and power dissipation. A 4x4 Vedic multiplier is designed using reversible Peres and HNG gates to realize the multiplication, with benefits of constant inputs, low garbage outputs, quantum cost, area and speed compared to other reversible logic multipliers.
The document discusses different methods for multiplication and their associated delays. It introduces the concept of Vedic mathematics as an ancient methodology for calculations based on 16 formulas. It then describes the Urdhva Tiryakbhyam multiplier technique, which reduces complexity, memory usage, and propagation delay for multiplication by calculating partial products in parallel rather than sequentially. This technique can be implemented in hardware to create an efficient complex multiplier with improved speed and lower power consumption compared to other architectures.
vlsi projects using verilog code 2014-2015E2MATRIX
E2MATRIX Research Lab
Are you scratching your head to write your M Tech thesis?
Don’t know where to start and where to find the relevant matter on the topic?
We Provide Complete Thesis Help For M.Tech / Phd Studnets.
E2MATRIX deals with Thesis guidance and research work for M.Tech, PhD Students.
If you are looking for professional thesis guidance then of course you are at the right place. We have a best team of Technical Developers and professionals who specialize in developing and delivering best and authenticated work with an assurance of on time delivery.
Contact : +91 9041262727, 9779363902.
Email : support@e2matrix.com
Web : www.e2matrix.com
The document contains Verilog code for several digital logic circuits including a 32-bit barrel shifter, 8-bit Booth multiplier, 32-bit ripple carry adder, 32-bit simple adder, and 32-bit carry lookahead adder. Test benches with stimulus are provided to test the functionality of each circuit.
IRJET- Low Power Adder and Multiplier Circuits Design Optimization in VLSIIRJET Journal
The document describes a proposed design for a low power 4-bit multiplier circuit using a hybrid full adder design with both pass-transistor logic and CMOS technology. The hybrid full adder uses 9 transistors compared to 12 in previous designs, reducing area and power. A faster Dadda algorithm is used to partition the partial product matrix into two parts that are reduced in parallel to two rows each using 3-bit and 2-bit counters, then combined with a carry look-ahead adder to form the final product. The proposed design aims to reduce propagation delay, power dissipation, and improve performance compared to previous multiplier circuit designs.
Implementation of UART with BIST Technique Using Low Power LFSRIJERA Editor
Asynchronous serial communication is usually implemented by Universal Asynchronous Receiver Transmitter
(UART), mostly used for low expense, low speed, short distance data exchange between processor and
peripherals. UART allows full duplex serial communication link, and is used in data communication and control
system. There is a need for realizing the UART function in a single or a very few chips. Further, design systems
without full testability are open to the increased possibility of product failures and missed market opportunities.
Also, it is necessary to ensure the data transfer is error proof. This project targets the introduction of Built-in self
test (BIST) and Status register to UART. The basic idea is to reduce the switching activity among the test
patterns at the most. In this approach, the single input change patterns generated by a counter and a gray code
generator are Exclusive-ORed with the seed generated by the low power linear feedback shift register [LP-LFSR].
The 8-bit UART with status register and BIST module is coded in Verilog HDL and synthesized and simulated
using Xilinx XST and ISim version 14.4 and realized on FPGA.
Design and Implementation of Area Optimized, Low Complexity CMOS 32nm Technol...IJERA Editor
A numerically controlled oscillator (NCO) is a digital signal generator which is a very important block in many Digital Communication Systems such as Software Defined Radios, Digital Radio set and Modems, Down/Up converters for Cellular and PCS base stations etc. NCO creates a synchronous, discrete-time, discrete-valued representation of a sinusoidal waveform. This paper implements the development and design of CMOS look up Table based numerically controlled oscillator which improves the performance, reduces the power & area requirement. The design is implemented with CMOS 32 nm Technology with Microwind 3.8 software tool. In addition, it can be used for analog circuit also enables the integration of complete system on chip. This paper also describes the design of a NCO which is of contemporary nature with reasonable speed, resolution and linearity with lower power, low area. For all about Pre Layout simulation has been realized using 32nm CMOS process Technology.
Design of 17-Bit Audio Band Delta-Sigma Analog to Digital ConverterKarthik Rathinavel
• Systematically designed a delta sigma ADC with CIFF modular architecture in MATLAB Simulink with an ENOB of 19-bits.
• Designed a decimation filter to remove noise in the digital output of the delta sigma modulator.
• Observed the effect of non-idealities on the modulator such as finite gain, finite bandwidth, slew rate, analog noise and capacitor mismatch.
The document discusses the design and simulation of a 3.8 GHz narrow bandpass switched capacitor filter implemented in a 180 nm CMOS technology. It begins by introducing switched capacitor filters and their advantages over traditional resistor-based filters. It then describes the implementation of a two-stage CMOS operational amplifier used in the filter design. Simulation results showing the amplifier's gain characteristics are presented. The document concludes by presenting the schematic and simulation results of the 3.8 GHz bandpass filter designed using the two-stage op-amp.
The document describes the design of a decimation filter for a sigma-delta analog-to-digital converter. It discusses the specifications and architecture of sigma-delta ADCs including the need for a decimation filter after the modulator stage. The decimation filter is designed using an IIR-FIR structure with cascaded integrator comb filters. Key blocks of the decimation filter include a coder circuit, clock divider, delay elements, and a circuit for programmability to allow the filter to operate at two different oversampling ratios of 16 and 64. The designed filter eliminates out-of-band noise efficiently and can be easily implemented in integrated circuits with low power consumption.
The document describes a proposed low power, high speed multiplier circuit designed using a technique called New Vedic VLSI. The multiplier uses a Vedic multiplication method to generate partial products faster. An addition section with a carry look ahead adder is used to sum the partial products, providing faster operation than a ripple carry adder. Simulation results showed the proposed design consumed 41.868 μw of power over 10ns, compared to 65.4 μw for a design using a ripple carry adder, for a 23.592 μw power reduction. The high speed, low power multiplier design is suitable for applications like digital signal processors that require efficient multiplication.
Types Of Window Being Used For The Selected GranuleLeslie Lee
The document discusses different types of mode selective devices that can be used for mode multiplexing over few-mode fiber. Free-space based devices are bulky while fiber based devices are more compact and easier to integrate. Early demonstrations transmitted data over 107 Gb/s using the LP01 and LP11 fiber modes and 58.8 Gb/s using dual modes with electronic MIMO processing for mode separation. Mode selective devices can be categorized as either free-space based or fiber based, with fiber based being preferable due to their compact size and integration capabilities.
A Novel Architecture for Different DSP Applications Using Field Programmable ...journal ijme
This paper presents a reconfigurable processor for different digital signal processing applications. The performance of the proposed architecture has been evaluated by taking different dsp applications like Low pass filter, high pass filter, finite impulse response (FIR) filter and FFT module. We designed the architecture of the processor and realizing the architecture using adder, multiplier, delay unit and validate it in the FPGA, which show that the hardware scheme is feasible for practical application. The experimental results clearly reveal the novelty of the architecture for dsp applications. This paper investigates the potential use of FPGAs for implementing efficient “Reconfigurable Processor” for different dsp applications. The proposed processor is based on parallel re-configurable which is implemented on FPGA. FPGAs have become an important component for implementing these functions with respect to cost, performance and flexibility. The general purpose SPARTAN 3AN FPGA kit has been employed for developing reconfigurable processor, with all the coding done using the hardware description language VERILOG.
Digital Implementation of Costas Loop with Carrier RecoveryIJERD Editor
Demodulator circuit is a basic building block of wireless communication. Digital implementation of
demodulator is attracting more attention for the significant advantages of digital systems than analog systems.
The carrier signal extraction is the main problem in synchronous demodulation in design of demodulator based
on Software Defined Radio. When transmitter or receiver in motion, it is difficult for demodulator to generate
carrier signal same in frequency and phase as transmitter carrier signal due to Doppler shift and Doppler rate.
Here the digital implementation of Costas loop for QPSK demodulation in continuous mode is discussed with
carrier recovery using phase locked loop.
IRJET - Design of a Low Power Serial- Parallel Multiplier with Low Transition...IRJET Journal
This document describes the design of a low power serial-parallel multiplier that uses a modified radix-4 Booth algorithm. It aims to improve performance over a standard serial-parallel Booth multiplier in terms of area, delay, and power. The proposed multiplier generates partial products conditionally, adding only non-zero Booth encodings and skipping zero operations to reduce transitions and increase throughput. It is implemented using FPGA technology to evaluate its utility for applications like digital signal processing and machine learning that require high performance multiplication.
This document presents the design of a phased array antenna system using phase shifters. A group of 4 students designed and simulated a 1x4 microstrip patch antenna array fed by a Wilkinson power divider in ADS software. They first designed a single rectangular patch antenna, then a 1:4 Wilkinson power divider and combined them into an antenna array. Phase shifters using varactor diodes were also designed and simulated for different voltage biases. The phase and insertion loss characteristics of the phase shifters were analyzed to verify their performance in the phased array system.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Efficient reconfigurable architecture of baseband demodulator in sdreSAT Journals
Abstract This paper presents the simulation architecture and performance analysis with the use of ZCD technic. A Zero-Crossing based All-Digital Baseband Demodulation architecture is proposed in this work. This architecture supports demodulation of all modulation schemes including MSK, PSK, FSK, and QAM. The proposed structure is very low area, low power, and low latency and can operate in real-time. Moreover it can switch, in run-time, between multiple modulation schemes like GMSK (GSM), QPSK (CDMA), GFSK (Bluetooth), 8-PSK (EDGE), Offset-QPSK (W-CDMA), etc. In addition, the phase resolution of the demodulator is scalable with performance. In addition, bit-wise amplitude quantization based quad-decomposition approach is utilized to demodulate higher order M-ary QAM modulations such as 16-QAM & 64-QAM, which is also a highly scalable architecture. This structure of demodulator provides energy-efficient and resource-efficient implementation of various wireless standards in physical layer of SDR. Keywords — Physical layer, Mobile and Wireless Communication, Software Defined radio (SDR), Zero Cross Detection (ZCD), Modulation Schemes, Architecture, high level synthesis, FPGA.
Modelling And Miniaturization of A 2-Bits Phase Shifter Using Koch Fractal Sh...IJERA Editor
Phase shifter is a key component in phase array antenna for the Radar application and the wireless communication system. This paper presents a novel design of miniaturised 2bits phase shifter using Koch fractal shapes of one iteration orders. The 3-section branch line coupler is used to extend the bandwidth of the phase shifter,this type of coupler is characterised by a low cost and simplicity of fabrication.Using the Koch fractal geometry the circuit size of the coupler is reduced to 6.36cm ×2.14cm at 2.4GHz. The simulation results show a good performance. So, over 2.1GHz-2.7GHzThe novel design of 2bits fractal reflection phase shifter based on the 3section show a return loss less than -20dB and the phase error varied between 0.1° and 0.4°for the four output phases . The circuit size of the phase shifter is reduced to9.5cm×2.1cm.
This document describes an FPGA-based passive K-Delta-1-Sigma (KD1S) sigma-delta modulator designed and tested by researchers. The modulator uses eight phase-shifted clocks on an FPGA to achieve an effective sampling rate of 450 MHz without active analog components. Testing showed the design achieved a peak SNR of 58 dB and ENOB of 9.3 bits at this high sampling rate, demonstrating the benefits of this passive approach for wide bandwidth applications.
This document describes the design of different types of parallel multipliers using low power techniques on a 0.18um technology node. It discusses Braun multipliers, row bypassing multipliers, and column bypassing multipliers. The multipliers are implemented using both conventional CMOS design and the Gate Diffusion Input (GDI) technique. Simulation results show that implementing the multipliers using GDI reduces transistor count and power consumption compared to the conventional design. The column bypassing multiplier implemented with GDI has the lowest power consumption of 3.4mw. In conclusion, combining row and column bypassing in a 2D multiplier design results in lower delay and power than the individual approaches.
This document describes the design of different types of parallel multipliers using low power techniques on a 0.18um technology node. It discusses Braun multipliers, row-bypassing multipliers, and column-bypassing multipliers. The multipliers are implemented using both conventional methods and the Gate-Diffusion-Input (GDI) technique. Simulation results show that implementing the multipliers using GDI reduces transistor counts and power consumption compared to conventional implementations. The 4x4 Braun multiplier implemented with GDI uses 136 transistors and consumes 3mW of power, providing significant improvements over the conventional implementation.
* Why need to use High Frequency low power Device??
* Introduction
* Design Developments
* Chipset Design
* Transmitter Chip
* Receiver Chip
* Measurement
* Result of Power Consumption
* Conclusion
Similar to Design of High Performance 8,16,32-bit Vedic Multipliers using SCL PDK 180nm Technology (20)
Design of High Performance 8,16,32-bit Vedic Multipliers using SCL PDK 180nm Technology
1. DESIGN OF HIGH PERFORMANCE
8,16,32-BIT VEDIC MULTIPLIERS
USING SCL PDK 180NM
TECHNOLOGY
Supervised By:
Dr. Anil K. Gupta
Co-ordinator of School
of VLSI Design and
Embedded Systems
Submitted By:
Yogendri
Roll No - 3142506
2. CONTENTS
1. INTRODUCTION
2. NEED OF MULTIPLIERS
3. VEDIC ALGORITHM
4. FULL ADDER
5. PROPOSED 8,16,32-BIT VEDIC MULTIPLIERS
6. PERFORMANCE ANALYSIS
7. HARDWARE IMPLEMENTATION
8. CONCLUSION
9. REFERENCES
3. INTRODUCTION
Multiplier is an essential functional block of a microprocessor because
multiplication is needed to be performed repeatedly in almost all scientific
calculations.
The fast and low power multipliers are required in small size wireless sensor
networks and many other DSP (Digital Signal Processing) applications. They
are also used in many algorithms such as FFT(Fast Fourier transform),
DFT(Discrete Fourier Transform)
There are two basic multiplication methods namely Booth multiplication
algorithm and Array multiplication algorithm used for the design of multipliers.
The schemes for efficient addition of partial products are Wallace tree [1];
Dadda tree [2]. The speed of multiplication (as well as power dissipation) is
dominantly controlled by the propagation delay of the full / half adders used for
the addition of partial products
4. TOOLS USED
Cadence EDA
Technology – SCL PDK 180nm
Simulator – Hspice
For DRC, LVS and PEX - Calibre
5. VEDIC ALGORITHM
Vedic multiplication method is described by Urdhva-tiryakbyham sutra of
Vedic arithmetic.
Fig. 1. 16X16 multiplication using UT sutra [3]
• Partial product generation
consists of vertically and
crosswise operations.
• Partial product
generations and additions
are carried out in parallel
6. BLOCK DIAGRAM OF (m)X(m) BINARY MULTIPLIER
(m/2)x(m/2) (m/2)x(m/2)
(m/2)x(m/2)(m/2)x(m/2)
k-bit Adder Block
Fig. 2. m x m multiplication using UT sutra [3]
2m
• For (m x m) multiplier, 4 numbers of
(m/2) x (m/2) multipliers are required.
• The first reduction layer requires ‘m’
full adders and second reduction stage
requires a k-bit binary adder (k is
equal to [(3/2) m-1] where m is the
number of bits in the operands)
7. FULLADDER
FEATURES OF FULL ADDER
1. It uses minimum area transistors (360n/180n for pMOS and 240n/180n
for nMOS is used in this work)
2. It should have equal delay from i/p to both the outputs i.e. Carry and
Sum due to which glitches are minimum
3. It has very compact layout.
These features of FA provides for carry skip operation.
A
C
B
Sum
Carry
10. TABLE 1
PROPAGATION DELAY OF FULL ADDER FOR THE PRE
LAYOUT AND POST LAYOUT SIMULATION
The power dissipation of FA was evaluated at the switching frequency of 500MHz. The
average power consumption was determined to be 55µW for pre layout simulation and 72
µW for post layout simulation i.e. with parasitics.
Full Adder Pre layout (ps) Post Layout (ps)
Min. Max. Min. Max.
A to Sum 177.1 268 237.5 401
A to Cout 171 294 222.5 450
Cin to Cout (when Cout
change)
171 202.5 222.5 267.5
Cin to Cout (when Cout
does not change)
1 1.5 11 14
11. PROPOSED 8-BIT MULTIPLIER
Fig. 5. Schematic of 8-bit multiplier
• Proposed 8-bit multiplier has
been designed using Cadence
Virtuoso in SCL PDK 180nm
technology and performance
was evaluated with power
supply of 1.8 volt using
Hspice
• It is designed with the help of
four 4 x 4 Vedic multiplier units
and 11-bit carry skip adder. For
the addition of intermediate
results generated from 4-bit
Vedic multiplier blocks 15 FA’s,
3 HA’s and 1 XOR gate is used
14. PROPOSED 16-BIT MULTIPLIER
Fig. 4. Schematic of 16-bit multiplier
• Proposed 16-bit multiplier has
been designed using Cadence
Virtuoso in SCL PDK 180nm
technology and performance
was evaluated with power
supply of 1.8 volt using
Hspice
• It is designed with the help of
four 8 x 8 Vedic multiplier units
and 23-bit carry skip adder. For
the addition of intermediate
results generated from 8-bit
Vedic multiplier blocks 31 FA’s,
7 HA’s and 1 XOR gate is used
17. PROPOSED 32-BIT VEDIC MULTIPLIER
Fig. 3. Schematic of 32-bit multiplier
• Proposed 16-bit multiplier
has been designed using
Cadence Virtuoso in SCL
PDK 180nm technology
and performance was
evaluated with power
supply of 1.8 volt using
Hspice
• It is designed with the help of
four 8 x 8 Vedic multiplier
units and 47-bit carry skip
adder. For the addition of
intermediate results generated
from 16-bit Vedic multiplier
blocks 63 FA’s,15 HA’s and 1
XOR gate is used
19. WAVEFORMS OF 32-BIT VEDIC MULTIPLIER
Fig. 4 Output waveform of M45-M63 for pre-layout Simulation
20. PERFORMANCE ANALYSIS
4-bit multiplier
A0 to M5 A0 to M7
Pre
layout
(ns)
Post
layout
(ns)
Pre
layout
(ns)
Post
layout
(ns)
0.835 1.4 0.282 0.42
8-bit multiplier
A0 to M9 A0 to M15
Pre
layout
(ns)
Post
layout
(ns)
Pre
layout
(ns)
Post
layout
(ns)
1.4 2.5 0.364 0.686
The performance analysis is carried out using Cadence EDA tool in SCL PDK180nm tech
at 1.8 power supply and parasitic extraction is done using Calibre
Table 2 Propagation Delay of multipliers
16-bit multiplier
A0 to M17 A0 to M31
Pre
layout
(ns)
Post
layout
(ns)
Pre
layout
(ns)
Post
layout
(ns)
1.532 3.5 0.435 1.28
32-bit multiplier
A0 to M33 A0 to M63
Pre
layout
(ns)
Post
layout
(ns)
Pre
layout
(ns)
Post
layout
(ns)
3.912 -- 0.524 --
22. 0
1
2
3
4
5
6
7
2-bit Vedic
multiplier
4bit Vedic
multiplier
8bit Vedic
multiplier
16bitVedic
multiplier
PropagationDelay(ns)
Name of Multipliers
Contribution of Interconnections to
the Propagation Delay
for post-layout
for pre-layout
Fig.5. Graph of Contribution of
interconnections to the Propagation
Delay
0
5000
10000
15000
20000
25000
30000
35000
40000
45000
2bit Vedic
multiplier
4bit Vedic
multiplier
8bit Vedic
multiplier
16bitVedic
multiplier
32bitVedic
multiplier
TransistorCount
Name of multipliers
Transistor Count of different
multipliers
Fig.6. Graph of Transistor Count of
different multipliers
24. TABLE 4
PERFORMANCE COMPARISON WITH OTHER MUTIPLIERS
Name of Multiplier
Technology
Propagation delay
Pre-layout (ns) Post-layout (ns)
4-bit Vedic
Multiplier
180nm
(This work)
A0 to
M5
A0 to
M7
A0 to
M5
A0 to
M7
0.835 0.243 1.42 0.399
45nm [33] 0.268* 0.754*
90nm [34] 1.11* --
180nm [35] 4.86* --
8-bit Vedic
Multiplier
180nm
(This work)
A0 to M9 A0 to M15 A0 to M9 A0 to M15
1.5 0.416 2.5 0.754
45nm [33] 0.635* 3.479*
90nm [34] 2.02* --
180nm [35] 13.36* --
25. 16-bit Vedic
Multiplier
180nm
(This work)
A0 to M17 A0 to M31 A0 to M17 A0 to M31
2.291 0.435 3.6 1.28
90nm [34] 4* --
180nm [35] 18.53* --
* Not specified whether it is from A0 to M5 or A0 to M7 for 4-bit or A0 to M9 or A0
to M15 for 8-bit or A0 to M17 or A0 to M31 for 16-bit multiplier
26. Name of multipliers Technology Power Dissipation (mW)
Pre Layout Post Layout
`
4-bit Vedic
Multiplier
180nm
(This work)
0.115(100MHz) 0.185(100MHz)
45nm [33] 0.842** 2.95**
90nm [34] 1.74** --
180nm [35] 0.2** --
8-bit Vedic
Multiplier
180nm
(This work)
0.630(100MHz) 1.04(100MHz)
45nm [33] 7.4** 26.76**
90nm [34] 3.29** --
180nm [35] 0.97** --
16-bit Vedic
Multiplier
180nm
(This work)
3.060(100MHz) 5.299(100MHz)
90nm [34] 6.5** --
180nm [35] 0.412** --
The power dissipation for multipliers is calculated at 100 MHz.
** Not specified at which frequency the power is calculated
27. CORNER ANALYSIS
For pre-Layout simulation
Topology Parameter ff fs sf ss tt
8-bit Vedic
multiplier
Propagation delay (ns) 1.07 1.46 1.34 1.92 1.4
Power dissipation (in
mW)
0.671 0.619 0.698 0.582 0.630
16-bit
Vedic
multiplier
Propagation
delay (ns)
1.75 2.38 2.152 3.376 2.291
Power dissipation (in
mW)
3.28 2.99 3.393 2.854 3.06
32-bit
Vedic
multiplier
Propagation
delay (ns)
3.014 4.07 3.65 5.206 3.912
Power dissipation (in
mW)
14.96 13.5 15.52 12.80
8
13.98
28. For Post-layout Simulation
Name of
Multiplier
Parameter ff fs sf ss tt
4-bit Vedic
multiplier
Propagation delay
(ns)
0.923 1.484 1.347 2 1.42
Power dissipation
(in mW)
0.203 0.184 194.4 0.173 0.185
8-bit Vedic
multiplier
Propagation delay
(ns)
2.06 2.9 2.57 3.8 2.5
Power dissipation
(in mW)
1.120 1.030 1.120 0.984 1.040
16-bit
Vedic
multiplier
Propagation delay
(ns)
3 5 4.56 4.9 3.6
Power dissipation
(in mW)
5.58 5.19 6.64 4.88 5.3
29. 0
1
2
3
4
5
6
ff fs sf ss tt
PropagationDelay(ns)
Process Corners
2bit Vedic multiplier
4bit Vedic multiplier
8bit Vedic multiplier
16bit Vedic multiplier
32bit Vedic multiplier
Fig.7. Graph of Propagation
Delay at different corners for
pre-layout simulation
0
2
4
6
8
10
12
14
16
18
ff fs sf ss tt
PowerDissipation(mW)
Process Corners
2-bit Vedic multiplier
4-bit Vedic multiplier
8-bit Vedic multiplier
16-bit Vedic multiplier
32-bit Vedic multiplier
Fig.8. Graph of Power dissipation
at different corners for pre-layout
simulation
30. 0
1
2
3
4
5
6
ff fs sf ss tt
PropagationDelay(ns)
Process Corners
2bit Vedic multiplier
4bit Vedic multiplier
8bit Vedic multiplier
16bit Vedic multiplier
Fig.9. Graph of Propagation
Delay at different corners for
post-layout simulation
0
1
2
3
4
5
6
7
ff fs sf ss tt
PowerDissipation(mW)
Process corners
2bit Vedic multiplier
4bit Vedic multiplier
8bit Vedic multiplier
16bit Vedic multiplier
Fig.10. Graph of Power Dissipation
at different corners for post-layout
simulation
32. PIN DESCRIPTION OF 8-BIT VEDIC MULTIPLIER
Pins Purpose
A0-A7 and B0 –B7 Input pins - operand bits to be multiplied
mul_en
It is an enable input pin to enable the inputs of input side
which are to be multiplied. When it is 1, all the inputs will be
available at the input side.
out_en
It is also an enable input pin to enable the outputs of output
side. When it is1, all the outputs will be available at the output
side.
VDD,VDDO,GND,VSSO
VDD_core for vdd and VSS_core for gnd to supply power to
the core. VDDO and VSSO are also power pins for vdd and
gnd respectively to provide supply to the ring.
M0-M7 Output pins i.e. output of the multiplier
34. 8-BIT VEDIC MULTIPLIER INCLUDING PADS
PC3D21 - I/P PAD
PT3O01 - O/P PAD
POWER PADS :
PVDI – To provide
supply voltage to core
PV0I – As a ground to
core
PVDA – To provide
supply voltage to padring
PV0A - As a ground to
padring
35. LAYOUT OF 8-BIT VEDIC MULTIPLIER WITH PADS
Area of Core =
0.008 mm2
Area of total
Chip =
1.890625mm2
(1.375 X 1.375)
36. PROPAGATION DELAY AND POWER DISSIPATION OF 8-
BIT VEDIC MULTIPLIER (INCLUDING PADS)
Specifications Pre-Layout Post-Layout
Power Consumption (core circuit
including driving circuit)
0.096mW(at10MHz) 0.159mW (at10MHz)
Power Consumption (including pads) 0.26mW(at10MHz) 0.215 (at 10MHz)
Delay (Core circuit including driving
circuit)
A0 to M9 – 1.765n
A0 to M15(MSB) –
0.76n
A0 to M9 – 3.47n
A0 to M15(MSB) – 1.5n
Delay (including pads)
A0 to M9 – 4.57n
A0 to M15 – 3.6n
A0 to M9 – 6.28n
A0 to M15 – 4.36n
37. CONCLUSION
The proposed 16-bit multiplier is implemented in SCL PDK 180nm tech
using cadence EDA tool and simulation is done using Hspice simulator. It has
been shown that
Highly compact layout leading to small contribution of interconnections
to the overall propagation delay. This is clearly indicated by relatively
small difference between pre layout and post layout propagation delay as
obtained by simulation.
High speed. The speed of the proposed multiplier design has been
shown to be significantly better than those reported earlier.
Vedic multiplication method offers the advantage of design reuse in the
sense that (n/2) x (n/2) multipliers and k- bit binary adders can be reused
for design of (n x n) multiplier.
The use of Full adders having equal input to output delay results in glitch
free output.
38. It has been shown that as the operand size increases the contribution of
interconnects to the propagation delay increases. It also has been shown that
implementation of Vedic multiplication method results in highly compact
layout leading to small contribution of interconnections to the overall
propagation delay. This is clearly indicated by relatively small difference
between pre-layout propagation delay and post-layout propagation delay as
obtained by simulation. This shows that optimized layout is of critical
importance for the designing of fast multipliers.
The layout of 8-bit Vedic multiplier has been given for fabrication but the
chip has not been fabricated yet by the Semiconductor lab. So, the
validation of the design could not be completed.
39. REFERENCES
1. C.S. Wallace, “A Suggestion for a Fast Multiplier,” IEEE Trans. Computers, vol. 13, no.
2, pp. 14-17, Feb. 1964.
2. L. Dadda, “Some Schemes for Parallel Multipliers,” Alta Frequenza, vol. 34, pp. 349-
356, Mar. 1965.
3. Amit Gupta, “Design of Fast, Low power 16 bit Multiplier using Vedic Mathematics,”
M.Tech. Thesis, SVNIT Surat, India, 2011.
4. Amit Gupta, R. K. Sharma, and Rasika Dhavse, “Low-Power High-Speed Small Area
Hybrid CMOS Full Adder,” Journal of Engineering and Technology, vol2,no.1,pp 41-44,
2012.
5. Suryasnata Tripathy, L B Omprakash, Sushanta K. Mandal & B S Patro, “Low Power
Multiplier Architectures using Vedic Mathematics in 45nm Technology for High Speed
Computing,” 2015 International Conference on Communication, Information &
Computing Technology (ICCICT), Mumbai ,Jan. 16-17,2015.
6. Prabir Saha, Arindam Banerjee, Partha Bhattacharyya, Anup Dandapat, “High Speed
ASIC Design of Complex Multiplier Using Vedic Mathematics,” Proceeding of the 2011
IEEE Students Technology Symposium, IIT Kharagpur, pp. 38, January 14-16, 2011.
40. 7. Arushi Somani, Dheeraj Jain, Sanjay Jaiswal, Kumkum Verma and Swati Kasht,
“Compare Vedic Multipliers with Conventional Heirarchical array of array
multiplier,” International Journal of Computer Technology and Electronics
Engineering (IJCTEE) vol. 2,no.6,2012.
41. PUBLICATION OUT OF THIS WORK
[1] Yogendri and Dr. A. K Gupta, “Design of High performance 8-bit Vedic
multiplier,” presented in IEEE International Conference in Advances in Computing,
Communication and Automation (ICACCA) 2016, at Tulas Institute, 8-9th April 2016.
[2] Yogendri and Dr. A. K Gupta, “Design of High performance 16-bit Vedic
multiplier,” published in National conference on Advances in Electrical, Engineering
and Energy Sciences (AEES - 2016), NIT Hamirpur, 24-25th May 2016.