Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1109/ISCIT.2012.6380956 | ISCIT |
Keywords | Field | DocType |
delays,residue number systems,table lookup,rns,delay,modified base extension scheme,residue number system,scaling scheme,lut based implementation,scaling | Computer science,Parallel computing,Scaling algorithm,Residue number system,Scaling | Conference |
ISBN | Citations | PageRank |
978-1-4673-1155-7 | 0 | 0.34 |
References | Authors | |
4 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yufeng Lai | 1 | 0 | 0.34 |
Yinan Kong | 2 | 0 | 0.68 |