New implementations of converters for the residue and quadratic residue number system

Seon Wook Kim, Thanos Stouraitis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Full adder (FA)-based converters are proposed for efficiently performing complex number calculations. The basic idea is to use FA arrays to decompose 2 i terms into 2 j terms, where j < i, by modulo arithmetic. FA-based converters show less hardware complexity and faster execution than ROM-based ones. The time-complexity product of FA-based converters is also much less than that of ROM-based ones.

Original languageEnglish
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
PublisherPubl by IEEE
Pages2959-2962
Number of pages4
Volume5
Publication statusPublished - 1991
Externally publishedYes
Event1991 IEEE International Symposium on Circuits and Systems Part 4 (of 5) - Singapore, Singapore
Duration: 1991 Jun 111991 Jun 14

Other

Other1991 IEEE International Symposium on Circuits and Systems Part 4 (of 5)
CitySingapore, Singapore
Period91/6/1191/6/14

Fingerprint

Numbering systems
Adders
ROM
Hardware

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Cite this

Kim, S. W., & Stouraitis, T. (1991). New implementations of converters for the residue and quadratic residue number system. In Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 5, pp. 2959-2962). Publ by IEEE.

New implementations of converters for the residue and quadratic residue number system. / Kim, Seon Wook; Stouraitis, Thanos.

Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 5 Publ by IEEE, 1991. p. 2959-2962.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kim, SW & Stouraitis, T 1991, New implementations of converters for the residue and quadratic residue number system. in Proceedings - IEEE International Symposium on Circuits and Systems. vol. 5, Publ by IEEE, pp. 2959-2962, 1991 IEEE International Symposium on Circuits and Systems Part 4 (of 5), Singapore, Singapore, 91/6/11.
Kim SW, Stouraitis T. New implementations of converters for the residue and quadratic residue number system. In Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 5. Publ by IEEE. 1991. p. 2959-2962
Kim, Seon Wook ; Stouraitis, Thanos. / New implementations of converters for the residue and quadratic residue number system. Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 5 Publ by IEEE, 1991. pp. 2959-2962
@inproceedings{fefb6d1f1ea04ccca0f06d10ae879a88,
title = "New implementations of converters for the residue and quadratic residue number system",
abstract = "Full adder (FA)-based converters are proposed for efficiently performing complex number calculations. The basic idea is to use FA arrays to decompose 2 i terms into 2 j terms, where j < i, by modulo arithmetic. FA-based converters show less hardware complexity and faster execution than ROM-based ones. The time-complexity product of FA-based converters is also much less than that of ROM-based ones.",
author = "Kim, {Seon Wook} and Thanos Stouraitis",
year = "1991",
language = "English",
volume = "5",
pages = "2959--2962",
booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - New implementations of converters for the residue and quadratic residue number system

AU - Kim, Seon Wook

AU - Stouraitis, Thanos

PY - 1991

Y1 - 1991

N2 - Full adder (FA)-based converters are proposed for efficiently performing complex number calculations. The basic idea is to use FA arrays to decompose 2 i terms into 2 j terms, where j < i, by modulo arithmetic. FA-based converters show less hardware complexity and faster execution than ROM-based ones. The time-complexity product of FA-based converters is also much less than that of ROM-based ones.

AB - Full adder (FA)-based converters are proposed for efficiently performing complex number calculations. The basic idea is to use FA arrays to decompose 2 i terms into 2 j terms, where j < i, by modulo arithmetic. FA-based converters show less hardware complexity and faster execution than ROM-based ones. The time-complexity product of FA-based converters is also much less than that of ROM-based ones.

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

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

M3 - Conference contribution

AN - SCOPUS:0026374761

VL - 5

SP - 2959

EP - 2962

BT - Proceedings - IEEE International Symposium on Circuits and Systems

PB - Publ by IEEE

ER -