Efficient RNS Reverse Converter using New Chinese Remainder Theorem I and the Moduli Set {24n, 22n+1, 2n+1, 2n-1}

Constant Akama

Research Article

Efficient RNS Reverse Converter using New Chinese Remainder Theorem I and the Moduli Set {24n, 22n+1, 2n+1, 2n-1}

by Constant Akama

International Journal of Computer Applications

Foundation of Computer Science (FCS), NY, USA

Volume 181 - Issue 12

Published: Aug 2018

Authors: Constant Akama

10.5120/ijca2018917701

PDF

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

                        @article{ 10.5120/ijca2018917701,
                        author  = { Constant Akama },
                        title   = { Efficient RNS Reverse Converter using New Chinese Remainder Theorem I and the Moduli Set {24n, 22n+1, 2n+1, 2n-1} },
                        journal = { International Journal of Computer Applications },
                        year    = { 2018 },
                        volume  = { 181 },
                        number  = { 12 },
                        pages   = { 11-14 },
                        doi     = { 10.5120/ijca2018917701 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }

                        %0 Journal Article
                        %D 2018
                        %A Constant Akama
                        %T Efficient RNS Reverse Converter using New Chinese Remainder Theorem I and the Moduli Set {24n, 22n+1, 2n+1, 2n-1}%T 
                        %J International Journal of Computer Applications
                        %V 181
                        %N 12
                        %P 11-14
                        %R 10.5120/ijca2018917701
                        %I Foundation of Computer Science (FCS), NY, USA

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

Computer Science

Information Sciences

No index terms available.

Keywords

Residue Number Systems Reverse Converter Moduli Set Chinese Remainder Theorem.