Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Carry-skip adder

Known as: Carry bypass adder, Carry skip adder, Carry-bypass adder 
A carry-skip adder (also known as a carry-bypass adder) is an adder implementation that improves on the delay of a ripple-carry adder with little… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper, we present a carry skip adder (CSKA) structure that has a higher speed yet lower energy consumption compared with… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2013
Highly Cited
2013
We propose a novel approximate adder design to significantly reduce energy consumption with a very moderate error rate. The… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Adders form an almost obligatory component of every contemporary integrated circuit. The prerequisite of the adder is that it is… Expand
  • figure 2
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2010
2010
USER 11.9999 Normal 0 false false false MicrosoftInternetExplorer4 st1\:*{behavior:url(#ieooui) } /* Style Definitions… Expand
  • figure 1
  • figure 1
  • figure 4
  • figure 3
  • table 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Irreversible logic circuits dissipate heat for every bit of information that is lost. Information is lost when the input vector… Expand
  • figure 1
  • figure 5
  • figure 9
  • figure 10
  • figure 12
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Reversible logic has become one of the most promising research areas in the past few decades and has found its applications in… Expand
  • figure 2
  • figure 3
  • figure 7
  • figure 4
  • figure 6
Is this relevant?
2006
2006
The design of a 32-bit carry-skip adder to achieve minimum delay is presented in this paper. The group generate and group… Expand
  • figure 1
  • figure 2
  • figure 4
  • table I
  • table II
Is this relevant?
1991
1991
  • V. Kantabutra
  • [] Proceedings 10th IEEE Symposium on Computer…
  • 1991
  • Corpus ID: 206509428
A method for designing optimum-speed one-level carry-skip adders is described. This method always yields the fastest adders if… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
  • S. Turrini
  • Proceedings of 9th Symposium on Computer…
  • 1989
  • Corpus ID: 30317701
The carry-skip adder, because of its greater topological regularity and layout simplicity, is considered a good compromise in… Expand
  • figure 1
  • figure 6
Is this relevant?
1967
1967
  • S. Majerski
  • IEEE Trans. Electron. Comput.
  • 1967
  • Corpus ID: 40769348
The methods for determining the carry skip distributions in the adders with the minimum carry propagation time and the minimum… Expand
Is this relevant?