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

Author

Kim, Seon Wook ; Stouraitis, Thanos

Author_Institution

Korea Inst. for Defense Anal., Seoul, South Korea

fYear

1991

fDate

11-14 Jun 1991

Firstpage

2959

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ⁱ 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

Keywords

adders; computational complexity; digital arithmetic; number theory; RNS; complex number calculations; full adder based convertors; hardware complexity; implementations; modulo arithmetic; quadratic residue number system; residual number system; time-complexity; Arithmetic; Automation; Energy consumption; Hardware; Programmable logic arrays; Radar signal processing; Read only memory; Signal analysis; Signal processing; Signal processing algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1991., IEEE International Sympoisum on

Print_ISBN

0-7803-0050-5

Type

conf

DOI

10.1109/ISCAS.1991.176166

Filename

176166

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2824020