@TechReport{,
  author = 	 {David Koes and Tiberiu Chelcea and Charles Onyeama and Seth Copen Goldstein},
  title = 	 {Adding Faster with Application Specific Early Termination},
  institution =  {Carnegie Mellon University},
  year = 	 {2005},
  number = 	 {CMU-CS-05-101},
  pages =        {20},
  month = 	 {May},
  url =          {http://reports-archive.adm.cs.cmu.edu/anon/2005/abstracts/05-101.html},
  abstract = {This paper presents a methodology for improving the speed of high-speed adders. As a starting point, a previously proposed method, called speculative completion, is used in which fast-terminating additions are automatically detected. Unlike the previous design, the method proposed in this paper is able to adapt dynamically to (1) application-specific behavior and (2) to adder-specific behavior, resulting in a higher detection rate of fast additions and, consequently, a faster average-case speed for addition. Our experimental results show detection rates of over 99\%, and adder average-case speed improvements of up to 14.\%.}
}