Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Design of high speed Wallace tree multiplier using 8-2 and 4-2 adder compressors
View through CrossRef
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 consuming circuits. Improvement in any of these parameters can be advantageous for improv-ing the efficiency of the circuit. High-speed multiplier which uses the high-speed adder is designed based on the Wallace tree concept in this paper. In this paper first we present an approach towards the reduction of delay in Wallace tree multipliers by using 8:2 and 4:2 adder com-pressors, in the partial product reduction stage. The proposed design is also compared to the Wallace Tree multiplier which uses 4:2 and 8:2 adder compressors in terms of propagation delay. The proposed design enhances speed of the system by 74.1% compared to the conven-tional Wallace Tree multiplier, while 24.1 % reduction was achieved in the delay of the system relative to Wallace tree multiplier with 16-bit adder with one of the 8-2 adder compressors.
Science Publishing Corporation
Title: Design of high speed Wallace tree multiplier using 8-2 and 4-2 adder compressors
Description:
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 consuming circuits.
Improvement in any of these parameters can be advantageous for improv-ing the efficiency of the circuit.
High-speed multiplier which uses the high-speed adder is designed based on the Wallace tree concept in this paper.
In this paper first we present an approach towards the reduction of delay in Wallace tree multipliers by using 8:2 and 4:2 adder com-pressors, in the partial product reduction stage.
The proposed design is also compared to the Wallace Tree multiplier which uses 4:2 and 8:2 adder compressors in terms of propagation delay.
The proposed design enhances speed of the system by 74.
1% compared to the conven-tional Wallace Tree multiplier, while 24.
1 % reduction was achieved in the delay of the system relative to Wallace tree multiplier with 16-bit adder with one of the 8-2 adder compressors.
.
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...
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...
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...
VLSI implementation of Wallace Tree Multiplier using Ladner-Fischer Adder
VLSI implementation of Wallace Tree Multiplier using Ladner-Fischer Adder
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 appl...
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...
Optimized 8-bit multiplier architecture using high-order compressors for area-efficient FPGA implementation
Optimized 8-bit multiplier architecture using high-order compressors for area-efficient FPGA implementation
Abstract
Efficient multiplier architectures are essential for improving the performance of digital signal processing (DSP) and FPGA-based computing systems while ...