Ripple-carry adder (RCA) is among the most common type of adder. However, it is not preferred in many applications because of its high latency. In this paper, two architectures of high-speed parallel RCA (PRCA) along with fault detection and localization are proposed, with reduced overhead as compared with carry look-ahead adder (CLA). In the proposed approach, RCA is divided into blocks, where the initial carry input for each block will be generated by a carry look-ahead logic unit. The delay is reduced by 43.81% as compared with the conventional 64-bit RCA design. The delay is further reduced by replacing the last blocks with a single RCA-based CSeA design and becomes equal to CLA if the last three blocks are replaced with CSeA. The propo...
Abstract — The basic building blocks of any processor are an adder. But carry generation is difficul...
Now a day’s hottest area of research in VLSI system is design of the area, high-speed and power-effi...
In this paper, we propose 128-bit Kogge-Stone, Ladner-Fischer, Spanning tree parallel prefix adders ...
In this paper, Carry Select Adder (CSA) architectures are proposed using parallel prefix adders. Ins...
The carry look-ahead adder (CLA) is well known among the family of high-speed adders. However, a con...
This article presents two area/latency optimized gate level asynchronous full adder designs which co...
A new design of binary parallel adder circuit is presented in this paper. The pipeline technique is ...
Abstract: This paper presents a comparative research of low-power and high-speed 4-bit full adder ci...
We present a new asynchronous quasi-delay-insensitive (QDI) block carry lookahead adder with redunda...
Asynchronous circuits employing delay-insensitive codes for data representation i.e. encoding and fo...
Addition is a specifically used indispensable computation used for most of the applications includin...
In processors and in digital circuit designs, adder is an important component. As a result, adder is...
In this paper, Carry Select Adder (CSA) architectures are proposed using parallel prefix adders. Ins...
International audienceInteger addition is a pervasive operation in FPGA designs. The need for fast w...
In Very Large Scale Integration (VLSI) designs, Parallel prefix adders (PPA) have the better delay p...
Abstract — The basic building blocks of any processor are an adder. But carry generation is difficul...
Now a day’s hottest area of research in VLSI system is design of the area, high-speed and power-effi...
In this paper, we propose 128-bit Kogge-Stone, Ladner-Fischer, Spanning tree parallel prefix adders ...
In this paper, Carry Select Adder (CSA) architectures are proposed using parallel prefix adders. Ins...
The carry look-ahead adder (CLA) is well known among the family of high-speed adders. However, a con...
This article presents two area/latency optimized gate level asynchronous full adder designs which co...
A new design of binary parallel adder circuit is presented in this paper. The pipeline technique is ...
Abstract: This paper presents a comparative research of low-power and high-speed 4-bit full adder ci...
We present a new asynchronous quasi-delay-insensitive (QDI) block carry lookahead adder with redunda...
Asynchronous circuits employing delay-insensitive codes for data representation i.e. encoding and fo...
Addition is a specifically used indispensable computation used for most of the applications includin...
In processors and in digital circuit designs, adder is an important component. As a result, adder is...
In this paper, Carry Select Adder (CSA) architectures are proposed using parallel prefix adders. Ins...
International audienceInteger addition is a pervasive operation in FPGA designs. The need for fast w...
In Very Large Scale Integration (VLSI) designs, Parallel prefix adders (PPA) have the better delay p...
Abstract — The basic building blocks of any processor are an adder. But carry generation is difficul...
Now a day’s hottest area of research in VLSI system is design of the area, high-speed and power-effi...
In this paper, we propose 128-bit Kogge-Stone, Ladner-Fischer, Spanning tree parallel prefix adders ...