Share Email Print

Proceedings Paper

Efficient arithmetic implementations based on carry-save representations
Author(s): Dhananjay S. Phatak; Tom Goff; Israel Koren
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper presents arithmetic implementations which use binary redundant numbers based on carry-save representations. It is well- known that constant-time addition, in which the execution delay is independent of operand length, is feasible only if the result is expressed in a redundant representation. Carry-save based formats are one type of a redundant representation which can lead to highly efficient implementations of arithmetic operations. In this paper, we discuss two specific carry-save formats that lead to particularly efficient realizations. We illustrate these formats, and the 'equal-weight grouping' (EWG) mechanism wherein bits having the same weight are grouped together during an arithmetic operation. This mechanism can reduce the area and delay complexity of an implementation. We present a detailed comparison of implementations based on these two carry-save formats including measurements from VLSI cell layouts. We then illustrate the application of these VLSI cells for multi-operand additions in fast parallel multipliers. Finally, we also indicate the relationship with previous results.

Paper Details

Date Published: 13 November 2000
PDF: 9 pages
Proc. SPIE 4116, Advanced Signal Processing Algorithms, Architectures, and Implementations X, (13 November 2000); doi: 10.1117/12.406503
Show Author Affiliations
Dhananjay S. Phatak, SUNY/Binghamton (United States)
Tom Goff, SUNY/Binghamton (United States)
Israel Koren, Univ. of Massachusetts/Amherst (United States)

Published in SPIE Proceedings Vol. 4116:
Advanced Signal Processing Algorithms, Architectures, and Implementations X
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top