Full Adder-Based Arithmetic Units for Finite Integer Rings

T. Stouraitis, S. W. 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 Nov

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Full Adder-Based Arithmetic Units for Finite Integer Rings'. Together they form a unique fingerprint.

  • Cite this