The week's pick
Random Articles
Reseach Article
Efficient RNS Reverse Converter using New Chinese Remainder Theorem I and the Moduli Set {24n, 22n+1, 2n+1, 2n-1}
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 181 - Number 12 |
| Year of Publication: 2018 |
| Authors: Constant Akama |
10.5120/ijca2018917701
|
Constant Akama . Efficient RNS Reverse Converter using New Chinese Remainder Theorem I and the Moduli Set {24n, 22n+1, 2n+1, 2n-1}. International Journal of Computer Applications. 181, 12 ( Aug 2018), 11-14. DOI=10.5120/ijca2018917701
Abstract
Residue number system (RNS) is a promising technology for high speed, power efficient and fault tolerant hardware design. The reason is that in RNS, arithmetic operations are performed in parallel, thus reducing delays due to carry operations. Additionally, RNS computations are faster than binary computations because of the reduced wordlength due to modulo operations. Despite the advantages of RNS, its performance depends on the moduli set and the reverse conversion algorithm used to convert the residue numbers back to binary form. There is therefore the need to select the moduli set and the reverse conversion algorithm carefully so that the performance of the RNS hardware is not overshadowed by reverse conversion overheads. This paper proposes an 8n bit moduli set 2 4
References
- A. S. Molahosseini, K. Navi, C. Dadkhah, O. Kavehei, and S. Timarchi, “Efficient Reverse Converter Designs for the New 4-Moduli Sets
- 2
Index Terms
Keywords