Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
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).
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

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...
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...
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...
Performance Comparison of Adder Topologies with Parallel Processing Adder Circuit
Performance Comparison of Adder Topologies with Parallel Processing Adder Circuit
In today’s modern era IC architecture design adders are become obligatory block. The growth in digitalization scenario to produce compact design products parameters like power, del...
A Novel High Computing Power Efficient VLSI Architectures of Three Operand Binary Adders
A Novel High Computing Power Efficient VLSI Architectures of Three Operand Binary Adders
Directly or indirectly adders are the basic elements in almost all digital circuits, three operand adders are the basic building blocks in LCG (Linear congruential generator) based...
Approximate Multiplier based on Low power and reduced latency with Modified LSB design
Approximate Multiplier based on Low power and reduced latency with Modified LSB design
The devised approximation multiplier can adapt the precision and processing power needed formul triplication sat run-time based on the needs of the user. To decrease error distance...
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...
Energy efficient design and implementation of approximate adder for image processing applications
Energy efficient design and implementation of approximate adder for image processing applications
Approximate computing is a new technique that promises to speed up computations while preserving a level of precision suitable for error-tolerant systems such as neural netwo...

Back to Top