Formal proof for a general architecture of hybrid prefix/carry-select adders

  • Authors:
  • Feng Liu;Qingping Tan;Xiaoyu Song;Gang Chen

  • Affiliations:
  • National Lab of Parallel Distributed Processing, Hunan, Chian;National Lab of Parallel Distributed Processing, Hunan, Chian;ECE department, Portland State University, Portland, OR;Lingcore Lab, Portland, OR

  • Venue:
  • ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present a general architecture of hybrid prefix/carry-select adder Based on this architecture, we formalize the hybrid adder's algorithm using the first-order recursive equations and develop a proof framework to prove its correctness Since several previous adders in the literature are special cases of this general architecture, our methodology can be used to prove the correctness of different hybrid prefix/carry-select adders The formal proof for a special hybrid prefix/carry-select adder shows the effectiveness of the algebraic structures built in this paper.