New CRT-based RNS converter using restricted moduli set

Research output: Contribution to journalArticlepeer-review

Abstract

This paper presents a new RNS converter using any number of relatively prime moduli of the form 2n and 2n ± 1. With the exception of common 3 moduli sets such as {2n - 1, 2n, 2n + 1}, RNS output converters based on the CRT require the computation of a sum of products modulo a large number. The new converter presented in this paper uses the fractional representation for the output and eliminates the requirement for multiplications, thereby reducing area and delay. Further area improvements are possible by exploiting the period of terms to be added. An algorithmic approach is used to obtain full adder-based architectures that are optimized for area and delay.

Original languageEnglish
Pages (from-to)572-578
Number of pages7
JournalIEEE Transactions on Computers
Volume52
Issue number5
DOIs
Publication statusPublished - May 2003

Keywords

  • Chinese remainder theorem (CRT)
  • Residue number system (RNS) converter

Fingerprint

Dive into the research topics of 'New CRT-based RNS converter using restricted moduli set'. Together they form a unique fingerprint.

Cite this