An Efficient CRT Based Reverse Converter for {22n+1-1, 2n-1, 22n-1} Moduli Set

Hassan Kehinde Bello *

Department of Computer Science, Federal Polytechnic, Offa, Nigeria and Department of Computer Science, Kwara State University, Malete, Nigeria.

Kazeem Alagbe Gbolagade

Department of Computer Science, Kwara State University, Malete, Nigeria.

*Author to whom correspondence should be addressed.


Abstract

This paper presents a reverse converter for the moduli set {22n+1-1, 2n-1, 22n-1} using a Chinese Remainder Theorem (CRT) algorithm and reverse method of data conversion. We compare our result with other converters found in literature that have the same Dynamic Range (DR) and our proposed algorithm has a better performance in terms of speed.

Aims: The aim of this study is to design a reverse converter for the moduli set {22n+1-1, 2n-1, 22n-1}, determine the speed and compare it with other moduli set with the same DR in literature.

Methodology: We applied Chinese Reminder Theorem algorithm for data conversion.

Keywords: Reverse converter, moduli set, Chinese remainder theorem, dynamic range, data conversion.


How to Cite

Bello, Hassan Kehinde, and Kazeem Alagbe Gbolagade. 2017. “An Efficient CRT Based Reverse Converter for {22n+1-1, 2n-1, 22n-1} Moduli Set”. Journal of Advances in Mathematics and Computer Science 25 (6):1-9. https://doi.org/10.9734/JAMCS/2017/38517.

Downloads

Download data is not yet available.