Fast scaling in the residue number system

Yinan Kong*, Braden Phillips

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

24 Citations (Scopus)
48 Downloads (Pure)


A new scheme for precisely scaling numbers in the residue number system (RNS) is presented. The scale factor $K$ can be any number coprime to the RNS moduli. Lookup table implementations are used as a basis for comparisons between the new scheme and scaling schemes from the literature. It is shown that new scheme decreases hardware complexity compared to previous schemes without affecting time complexity.

Original languageEnglish
Article number4749262
Pages (from-to)443-447
Number of pages5
JournalIEEE Transactions on Very Large Scale Integration (VLSI) Systems
Issue number3
Publication statusPublished - Mar 2009
Externally publishedYes

Bibliographical note

Copyright 2009 IEEE. Reprinted from IEEE Transactions on Very Large Scale Integration (VLSI) Systems. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie University’s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Fingerprint Dive into the research topics of 'Fast scaling in the residue number system'. Together they form a unique fingerprint.

Cite this