Javascript must be enabled to continue!
Booth Multiplier Based on Low Power High Speed Full Adder With Fin_FET Technology
View through CrossRef
This paper proposes a novel Fin FET-based HSFA for the multiplier in order to overcome the issues of low speed operation. It is advantageous to use Fin FETs to construct the arithmetic circuit while assessing the available works. The carry propagation and slow operation of the old technique are disadvantages. The CMOS-based compressor circuit, on the other hand, suffers from leakage current, which reduces its driving capabilities. High current DSP applications are well matched to the design's specifications. Even with a supply voltage of 1 volt, the proposed device has a decent driving capability. As a result, the circuit runs more quickly and has less latency. A transmission gate is used in the design of the suggested adder structure to selectively block or transfer data from the input to output. Half adder and adder are shown in the following illustrations. The smaller the transistor count, the less power it uses. The suggested Fin FET design for the smaller transistors has a superior driving capability than the CMOS equivalent. Additionally, when cascading, the Fin FET based adder may contribute to superior switch performance, such as when using ripple carry adder. There is also the possibility of a low operation, which may operate at Low wattage Electronic designs for high-performance and small devices have become increasingly dependent on the use of VLSI circuits. The power of a processor is determined in large part by the multiplier used in its design. Multiplier factor booth coding is being used to reorder the input bits in order to reduce facility use. The booth decoder works by rearranging the specified booth equivalent. The Booth decoder has the ability to expand the range of zeros. As a result, the power consumption of the design will be decreased even more. As soon as the input bit constant drops below zero, related rows or columns of an adder must be disabled, if possible.
Auricle Technologies, Pvt., Ltd.
Title: Booth Multiplier Based on Low Power High Speed Full Adder With Fin_FET Technology
Description:
This paper proposes a novel Fin FET-based HSFA for the multiplier in order to overcome the issues of low speed operation.
It is advantageous to use Fin FETs to construct the arithmetic circuit while assessing the available works.
The carry propagation and slow operation of the old technique are disadvantages.
The CMOS-based compressor circuit, on the other hand, suffers from leakage current, which reduces its driving capabilities.
High current DSP applications are well matched to the design's specifications.
Even with a supply voltage of 1 volt, the proposed device has a decent driving capability.
As a result, the circuit runs more quickly and has less latency.
A transmission gate is used in the design of the suggested adder structure to selectively block or transfer data from the input to output.
Half adder and adder are shown in the following illustrations.
The smaller the transistor count, the less power it uses.
The suggested Fin FET design for the smaller transistors has a superior driving capability than the CMOS equivalent.
Additionally, when cascading, the Fin FET based adder may contribute to superior switch performance, such as when using ripple carry adder.
There is also the possibility of a low operation, which may operate at Low wattage Electronic designs for high-performance and small devices have become increasingly dependent on the use of VLSI circuits.
The power of a processor is determined in large part by the multiplier used in its design.
Multiplier factor booth coding is being used to reorder the input bits in order to reduce facility use.
The booth decoder works by rearranging the specified booth equivalent.
The Booth decoder has the ability to expand the range of zeros.
As a result, the power consumption of the design will be decreased even more.
As soon as the input bit constant drops below zero, related rows or columns of an adder must be disabled, if possible.
Related Results
4*4 Braun Multiplier using Adder Cells
4*4 Braun Multiplier using Adder Cells
The 4×4 Braun Multiplier using Adder Cells represents a fundamental and efficient digital circuit architecture designed to perform binary multiplication of two 4-bit unsigned numbe...
Design of delay efficient Booth multiplier using pipelining
Design of delay efficient Booth multiplier using pipelining
Multiplication is one of the most an essential arithmetic operation used in numerous applications in digital signal processing and communications. These applications need transform...
A 32-bit Ripple-Ling Hybrid Carry adder
A 32-bit Ripple-Ling Hybrid Carry adder
Abstract - This paper presents the design and implementation of a 32-bit Ripple Carry Hybrid Adder that combines the simplicity of the Ripple-Carry Adder (RCA) with the speed advan...
High-Speed Area-Efficient VLSI Architecture of Three Operand Binary Adder
High-Speed Area-Efficient VLSI Architecture of Three Operand Binary Adder
This paper proposes a novel high-speed three-operand binary adder architecture, namely the Han-Carlson adder, which mitigates the inherent limitations of traditional Carry Save Add...
Designing RNS-based FIR filter with Optimal area, Delay, and Power via the use of Swift Adders and Swift Multipliers
Designing RNS-based FIR filter with Optimal area, Delay, and Power via the use of Swift Adders and Swift Multipliers
Based on the Residue Number System (RNS), Finite Impulse Response filters have gained prominence in digital signal processing due to their efficiency in handling complex computatio...
Four-bit Nanoadder Controlled by Five-Inputs Majority Elements
Four-bit Nanoadder Controlled by Five-Inputs Majority Elements
This paper presents a nano circuit of a full one-bit adder on the proposed five-input majority element. This innovative full adder design is used to development of a four-bit adder...
Design of high speed Wallace tree multiplier using 8-2 and 4-2 adder compressors
Design of high speed Wallace tree multiplier using 8-2 and 4-2 adder compressors
Multiplication is one of the most common arithmetic operations employed in digital systems such as FIR filters and DSP processors but multipliers are the most time, area, and power...
HIGH-EFFICIENT VLSI ARCHITECTURE FOR THREE OPERAND BINARY ADDER
HIGH-EFFICIENT VLSI ARCHITECTURE FOR THREE OPERAND BINARY ADDER
This paper presents a VLSI architecture for a three-operand binary adder. The proposed design is based on a carry-select adder (CSLA) and Han-Carlson (HCA) adder. Carry-select adde...

