Fast scaling in the residue number system

Authors:
Yinan Kong;Braden Phillips
Affiliations:
Centre for High Performance Integrated Technologies and Systems, School of Electrical and Electronic Engineering, University of Adelaide, Adelaide, SA, Australia;Centre for High Performance Integrated Technologies and Systems, School of Electrical and Electronic Engineering, University of Adelaide, Adelaide, SA, Australia
Venue:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Year:
2009

Citing 8
Cited 0

Fast Base Extension Using a Redundant Modulus in RNS

IEEE Transactions on Computers
Modulo Reduction in Residue Number Systems

IEEE Transactions on Parallel and Distributed Systems
A Look-Up Scheme for Scaling in the RNS

IEEE Transactions on Computers
Fast Combinatorial RNS Processors for DSP Applications

IEEE Transactions on Computers
Scaling an RNS Number Using the Core Function

ARITH '03 Proceedings of the 16th IEEE Symposium on Computer Arithmetic (ARITH-16'03)
New power-of-2 RNS scaling scheme for cell-based IC design

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Residue Number Scaling and Other Operations Using ROM Arrays

IEEE Transactions on Computers
Fast base extension and precise scaling in RNS for look-up tableimplementations

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.