Javascript must be enabled to continue!
VLSI implementation of Wallace Tree Multiplier using Ladner-Fischer Adder
View through CrossRef
Nowadays, most of the application depends on arithmetic designs such as an adder, multiplier, divider, etc. Among that, multipliers are very essential for designing industrial applications such as Finite Impulse Response, Fast Fourier Transform, Discrete cosine transform, etc. In the conventional methods, different kind of multipliers such as array multiplier, booth multiplier, bough Wooley multiplier, etc. are used. These existing multipliers are occupied more area to operate. In this study, Wallace Tree Multiplier (WTM) is implemented to overcome this problem. Two kinds of multipliers have designed in this research work for comparison. At first, existing WTM is designed with normal full adders and half adders. Next, proposed WTM is designed using Ladner Fischer Adder (LFA) to improve the hardware utilization and reduce the power consumption. Field Programmable Gate Array (FPGA) performances such as slice Look Up Table (LUT), Slice Register, Bonded Input-Output Bios (IOB) and power consumption are evaluated. The proposed WTM-LFA architecture occupied 374 slice LUT, 193 slice register, 59 bonded IOB, and 26.31W power. These FPGA performances are improved compared to conventional multipliers such asModified Retiming Serial Multiplier (MRSM), Digit Based Montgomery Multiplier (DBMM), and Fast Parallel Decimal Multiplier (FPDM).
The Intelligent Networks and Systems Society
Title: VLSI implementation of Wallace Tree Multiplier using Ladner-Fischer Adder
Description:
Nowadays, most of the application depends on arithmetic designs such as an adder, multiplier, divider, etc.
Among that, multipliers are very essential for designing industrial applications such as Finite Impulse Response, Fast Fourier Transform, Discrete cosine transform, etc.
In the conventional methods, different kind of multipliers such as array multiplier, booth multiplier, bough Wooley multiplier, etc.
are used.
These existing multipliers are occupied more area to operate.
In this study, Wallace Tree Multiplier (WTM) is implemented to overcome this problem.
Two kinds of multipliers have designed in this research work for comparison.
At first, existing WTM is designed with normal full adders and half adders.
Next, proposed WTM is designed using Ladner Fischer Adder (LFA) to improve the hardware utilization and reduce the power consumption.
Field Programmable Gate Array (FPGA) performances such as slice Look Up Table (LUT), Slice Register, Bonded Input-Output Bios (IOB) and power consumption are evaluated.
The proposed WTM-LFA architecture occupied 374 slice LUT, 193 slice register, 59 bonded IOB, and 26.
31W power.
These FPGA performances are improved compared to conventional multipliers such asModified Retiming Serial Multiplier (MRSM), Digit Based Montgomery Multiplier (DBMM), and Fast Parallel Decimal Multiplier (FPDM).
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 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...
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...
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...
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...
Booth Multiplier Based on Low Power High Speed Full Adder With Fin_FET Technology
Booth Multiplier Based on Low Power High Speed Full Adder With Fin_FET Technology
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 arithm...
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...
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...

