Talk:Carry-skip adder

This article is rated Stub-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:

Computing

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
???	This article has not yet received a rating on the project's importance scale.
	This article is supported by Computer hardware task force.
	This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the `\|auto=` parameter.

Example Implementation[edit]

It looks to me like the example implementation is actually describing a carry-select adder rather than a carry-bypass adder. I'm only learning about adders right now, but once I feel more confident I might come back and fix it up. On the other hand, the example has been there for over five years and no one has complained. Jrmrjnck (talk) 03:22, 28 October 2012 (UTC)[reply]

Article Title Should Be Carry-Skip Adder[edit]

I think it's worth noting that most research papers published in IEEE Xplore denote this type of adder as a "carry-skip adder", since it's first implementation in the early 1960's used this denomination (and subsequent implementations followed this nomenclature). Carry-bypass adders only appeared in-text starting in the 80's, and is an alias of the name "carry-skip adder".

I propose that this should be the main article title (carry-skip adder, it currently doesn't exist), and that carry-bypass adder should be redirected there (with a mention that they are indeed the same circuit). — Preceding unsigned comment added by Bcastell (talk • contribs) 15:46, 29 November 2012 (UTC)[reply]

Why don't you start by adding some references? If the references say carry carry-skip, it will be an easy decision. Dicklyon (talk) 17:13, 29 November 2012 (UTC)[reply]

Thanks for the response; below is a list of relevant references with DOI links:

Dec. 1961, "Skip Techniques for High-Speed Carry-Propagation in Binary Arithmetic Units" (Carry-Skip)
Oct. 1987, "A Way to Build Efficient Carry-Skip Adders" (Carry-Skip)
June 1989, "Efficient Algorithms for Computing the Longest Viable Path in a Combinational Network" (Carry-Bypass)

As you can see, the first indication of "carry-bypass" occured far after "carry-skip". Furthermore, searching IEEE Xplore for "carry-bypass" yields only 9 results, while searching "carry-skip" yields 93 results. Bcastell (talk) 15:36, 3 December 2012 (UTC)[reply]

In light of the last comment made above, I've moved the article to the relevant new name, leaving carry-bypass adder to still redirect here. Also updated the article to mention both names, and added a small snippet of why the latency of the adder is improved. Still need to find appropriate references, but for the curious, a great reference is B. Parhami's lecture slides from his Computer Arithmetic textbook. Bcastell (talk) 13:13, 10 December 2012 (UTC)[reply]