A Fast VLSI Adder Architecture

H. R. Srinivas, Keshab K. Parhi

Research output: Contribution to journalArticle

41 Citations (Scopus)

Abstract

In this paper we present an architecture for performing fixed-point, high-speed, two’s-complement, bit-parallel addition by using the carry-free property of redundant arithmetic and a fast parallel redundant-to-binary conversion scheme. In this architecture, the internal numbers are represented in radix-2 redundant digit form and the inputs and the output of the adder are represented in two’s-complement binary form. The adder operands are added first in a radix-2 redundant adder to produce the result in radix-2 digit (-1, 0, 1) form. This result is then converted to two’s-complement binary form by using the proposed fast parallel conversion scheme. The high-speed conversion for long words is achieved through the use of a novel sign-select operation. This proposed adder is referred to as the sign-select conversion adder and is faster than all previous high-speed two’s-complement binary adders for large word lengths (although it requires larger area). For word lengths between 16 and 64, the proposed design is 20-28% faster than the fastest known binary lookahead adder. The implementation is highly regular with repeated modules and is very well suited for VLSI implementation.

Original languageEnglish (US)
Pages (from-to)761-767
Number of pages7
JournalIEEE Journal of Solid-State Circuits
Volume27
Issue number5
DOIs
StatePublished - May 1992

Fingerprint

Adders

Cite this

A Fast VLSI Adder Architecture. / Srinivas, H. R.; Parhi, Keshab K.

In: IEEE Journal of Solid-State Circuits, Vol. 27, No. 5, 05.1992, p. 761-767.

Research output: Contribution to journalArticle

Srinivas, H. R. ; Parhi, Keshab K. / A Fast VLSI Adder Architecture. In: IEEE Journal of Solid-State Circuits. 1992 ; Vol. 27, No. 5. pp. 761-767.
@article{63360925653e4186b0820c1560b46085,
title = "A Fast VLSI Adder Architecture",
abstract = "In this paper we present an architecture for performing fixed-point, high-speed, two’s-complement, bit-parallel addition by using the carry-free property of redundant arithmetic and a fast parallel redundant-to-binary conversion scheme. In this architecture, the internal numbers are represented in radix-2 redundant digit form and the inputs and the output of the adder are represented in two’s-complement binary form. The adder operands are added first in a radix-2 redundant adder to produce the result in radix-2 digit (-1, 0, 1) form. This result is then converted to two’s-complement binary form by using the proposed fast parallel conversion scheme. The high-speed conversion for long words is achieved through the use of a novel sign-select operation. This proposed adder is referred to as the sign-select conversion adder and is faster than all previous high-speed two’s-complement binary adders for large word lengths (although it requires larger area). For word lengths between 16 and 64, the proposed design is 20-28{\%} faster than the fastest known binary lookahead adder. The implementation is highly regular with repeated modules and is very well suited for VLSI implementation.",
author = "Srinivas, {H. R.} and Parhi, {Keshab K.}",
year = "1992",
month = "5",
doi = "10.1109/4.133165",
language = "English (US)",
volume = "27",
pages = "761--767",
journal = "IEEE Journal of Solid-State Circuits",
issn = "0018-9200",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - A Fast VLSI Adder Architecture

AU - Srinivas, H. R.

AU - Parhi, Keshab K.

PY - 1992/5

Y1 - 1992/5

N2 - In this paper we present an architecture for performing fixed-point, high-speed, two’s-complement, bit-parallel addition by using the carry-free property of redundant arithmetic and a fast parallel redundant-to-binary conversion scheme. In this architecture, the internal numbers are represented in radix-2 redundant digit form and the inputs and the output of the adder are represented in two’s-complement binary form. The adder operands are added first in a radix-2 redundant adder to produce the result in radix-2 digit (-1, 0, 1) form. This result is then converted to two’s-complement binary form by using the proposed fast parallel conversion scheme. The high-speed conversion for long words is achieved through the use of a novel sign-select operation. This proposed adder is referred to as the sign-select conversion adder and is faster than all previous high-speed two’s-complement binary adders for large word lengths (although it requires larger area). For word lengths between 16 and 64, the proposed design is 20-28% faster than the fastest known binary lookahead adder. The implementation is highly regular with repeated modules and is very well suited for VLSI implementation.

AB - In this paper we present an architecture for performing fixed-point, high-speed, two’s-complement, bit-parallel addition by using the carry-free property of redundant arithmetic and a fast parallel redundant-to-binary conversion scheme. In this architecture, the internal numbers are represented in radix-2 redundant digit form and the inputs and the output of the adder are represented in two’s-complement binary form. The adder operands are added first in a radix-2 redundant adder to produce the result in radix-2 digit (-1, 0, 1) form. This result is then converted to two’s-complement binary form by using the proposed fast parallel conversion scheme. The high-speed conversion for long words is achieved through the use of a novel sign-select operation. This proposed adder is referred to as the sign-select conversion adder and is faster than all previous high-speed two’s-complement binary adders for large word lengths (although it requires larger area). For word lengths between 16 and 64, the proposed design is 20-28% faster than the fastest known binary lookahead adder. The implementation is highly regular with repeated modules and is very well suited for VLSI implementation.

UR - http://www.scopus.com/inward/record.url?scp=0026867592&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026867592&partnerID=8YFLogxK

U2 - 10.1109/4.133165

DO - 10.1109/4.133165

M3 - Article

AN - SCOPUS:0026867592

VL - 27

SP - 761

EP - 767

JO - IEEE Journal of Solid-State Circuits

JF - IEEE Journal of Solid-State Circuits

SN - 0018-9200

IS - 5

ER -