An implementation of a scaler in the Residue number System

This paper presents an implementation of an efficient scaling algorithm in the Residue number System (RNS). The original base extension scheme is modified to improve the performance. This modified base extension scheme also requires less hardware space than the original algorithm. Analysis shows the delay of this scaling scheme could be reduced further by switching to more efficient base extension algorithms.