Full Adder-Based Arithmetic Units for Finite Integer Rings

T. Stouraitis, Seon Wook Kim, A. Skavantzos

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

Most implementations of accumulators, multipliers, or multiplier-accumulator units, operating in a finite integer ring, R{m), are based on ROM's or PLA's. This paper proposes a full adder-based arithmetic unit, called an (FA)-based AUm, capable of performing both addition and general multiplication at the same time, in R(m). For all moduli, FA-based AUm's are shown to execute much faster and have much less hardware complexity and smaller time-complexity products than ROM-based AUm's. For large values of m, they are also shown to be less complex and have smaller time-complexity products than ROM-based units, which are capable of performing multiplication only by a constant. Since the proposed units use full adders as the basic building block, they result in easy-to-design, modular, and regular VLSI implementations.

Original languageEnglish
Pages (from-to)740-745
Number of pages6
JournalIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Volume40
Issue number11
DOIs
Publication statusPublished - 1993
Externally publishedYes

Fingerprint

ROM
Adders
Hardware

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing

Cite this

Full Adder-Based Arithmetic Units for Finite Integer Rings. / Stouraitis, T.; Kim, Seon Wook; Skavantzos, A.

In: IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, Vol. 40, No. 11, 1993, p. 740-745.

Research output: Contribution to journalArticle

@article{20c6109190e9494ebf0f12028910fa4d,
title = "Full Adder-Based Arithmetic Units for Finite Integer Rings",
abstract = "Most implementations of accumulators, multipliers, or multiplier-accumulator units, operating in a finite integer ring, R{m), are based on ROM's or PLA's. This paper proposes a full adder-based arithmetic unit, called an (FA)-based AUm, capable of performing both addition and general multiplication at the same time, in R(m). For all moduli, FA-based AUm's are shown to execute much faster and have much less hardware complexity and smaller time-complexity products than ROM-based AUm's. For large values of m, they are also shown to be less complex and have smaller time-complexity products than ROM-based units, which are capable of performing multiplication only by a constant. Since the proposed units use full adders as the basic building block, they result in easy-to-design, modular, and regular VLSI implementations.",
author = "T. Stouraitis and Kim, {Seon Wook} and A. Skavantzos",
year = "1993",
doi = "10.1109/82.251845",
language = "English",
volume = "40",
pages = "740--745",
journal = "IEEE Transactions on Circuits and Systems I: Regular Papers",
issn = "1549-8328",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

TY - JOUR

T1 - Full Adder-Based Arithmetic Units for Finite Integer Rings

AU - Stouraitis, T.

AU - Kim, Seon Wook

AU - Skavantzos, A.

PY - 1993

Y1 - 1993

N2 - Most implementations of accumulators, multipliers, or multiplier-accumulator units, operating in a finite integer ring, R{m), are based on ROM's or PLA's. This paper proposes a full adder-based arithmetic unit, called an (FA)-based AUm, capable of performing both addition and general multiplication at the same time, in R(m). For all moduli, FA-based AUm's are shown to execute much faster and have much less hardware complexity and smaller time-complexity products than ROM-based AUm's. For large values of m, they are also shown to be less complex and have smaller time-complexity products than ROM-based units, which are capable of performing multiplication only by a constant. Since the proposed units use full adders as the basic building block, they result in easy-to-design, modular, and regular VLSI implementations.

AB - Most implementations of accumulators, multipliers, or multiplier-accumulator units, operating in a finite integer ring, R{m), are based on ROM's or PLA's. This paper proposes a full adder-based arithmetic unit, called an (FA)-based AUm, capable of performing both addition and general multiplication at the same time, in R(m). For all moduli, FA-based AUm's are shown to execute much faster and have much less hardware complexity and smaller time-complexity products than ROM-based AUm's. For large values of m, they are also shown to be less complex and have smaller time-complexity products than ROM-based units, which are capable of performing multiplication only by a constant. Since the proposed units use full adders as the basic building block, they result in easy-to-design, modular, and regular VLSI implementations.

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

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

U2 - 10.1109/82.251845

DO - 10.1109/82.251845

M3 - Article

AN - SCOPUS:0027702824

VL - 40

SP - 740

EP - 745

JO - IEEE Transactions on Circuits and Systems I: Regular Papers

JF - IEEE Transactions on Circuits and Systems I: Regular Papers

SN - 1549-8328

IS - 11

ER -