Carnegie Mellon University
Browse

Adding faster with application specific early termination

Download (506.12 kB)
journal contribution
posted on 1996-11-01, 00:00 authored by David Koes
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.8%."

History

Date

1996-11-01

Usage metrics

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC