Talk:Carry-skip adder

Example Implementation
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)

Article Title Should Be Carry-Skip Adder
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)


 * 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)


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

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)
 * 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)


 * 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)