Adding Faster with Application Specific Early Termination

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%.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2005
Accession Number
ADA457103

Entities

People

  • Charles Onyeama
  • David Koes
  • Seth C. Goldstein
  • Tiberiu Chelcea

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Accuracy
  • Algorithms
  • Arithmetic
  • Circuits
  • Communication Channels
  • Compilers
  • Computations
  • Computer Programming
  • Computer Science
  • Detection
  • Energy Consumption
  • Logic
  • Logic Gates
  • Networks
  • Optimization
  • Standards
  • Xor Gates

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Integrated Circuit Design and Technology.
  • Systems Analysis and Design